{"id":"https://openalex.org/W2404196336","doi":null,"title":"Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter","display_name":"Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter","publication_year":2015,"publication_date":"2015-12-04","ids":{"openalex":"https://openalex.org/W2404196336","mag":"2404196336"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.698.5221","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.698.5221","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://theory.stanford.edu/%7Evirgi/betw.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hdl.handle.net/1721.1/146446","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5051832024","display_name":"Amir Abboud","orcid":"https://orcid.org/0000-0002-0502-4517","observed_orcids":["https://orcid.org/0000-0002-0502-4517"]},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Amir Abboud","raw_affiliation_strings":["Stanford University ()"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University ()","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Fabrizio Gr","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I57201433","display_name":"Universit\u00e0 della Svizzera italiana","ror":"https://ror.org/03c4atk17","country_code":"CH","type":"education","lineage":["https://openalex.org/I57201433"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Fabrizio Gr","raw_affiliation_strings":["University of Lugano"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Lugano","institution_ids":["https://openalex.org/I57201433"]}]},{"author_position":"last","author":{"id":null,"display_name":"Oni Virginia Vassilevska Williams","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Oni Virginia Vassilevska Williams","raw_affiliation_strings":["Stanford University ()"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University ()","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":16.8287,"has_fulltext":false,"cited_by_count":69,"citation_normalized_percentile":{"value":0.99519055,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":100},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.000699999975040555,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.00039999998989515007,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/graph-centrality-measures","display_name":"graph centrality","score":0.8679999709129333},{"id":"https://openalex.org/keywords/subcubic-algorithms","display_name":"subcubic algorithms","score":0.777999997138977},{"id":"https://openalex.org/keywords/all-pairs-shortest-paths","display_name":"all-pairs shortest paths","score":0.8700000047683716},{"id":"https://openalex.org/keywords/graph-diameter","display_name":"graph diameter","score":0.8629999756813049},{"id":"https://openalex.org/keywords/betweenness-centrality","display_name":"betweenness centrality","score":0.9089999794960022},{"id":"https://openalex.org/keywords/graph-median","display_name":"graph median","score":0.6880000233650208},{"id":"https://openalex.org/keywords/graph-center","display_name":"graph center","score":0.9259999990463257},{"id":"https://openalex.org/keywords/fine-grained-complexity","display_name":"fine-grained complexity","score":0.6269999742507935}],"concepts":[{"id":"https://openalex.org/C117045392","wikidata":"https://www.wikidata.org/wiki/Q4899215","display_name":"Betweenness centrality","level":3,"score":0.9098056554794312},{"id":"https://openalex.org/C53811970","wikidata":"https://www.wikidata.org/wiki/Q5062194","display_name":"Centrality","level":2,"score":0.762156069278717},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6724554300308228},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6719207763671875},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6322227120399475},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.586590588092804},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.49911022186279297},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4063276946544647},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.698.5221","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.698.5221","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://theory.stanford.edu/%7Evirgi/betw.pdf","raw_type":"text"},{"id":"pmh:oai:dspace.mit.edu:1721.1/146446","doi":null,"is_oa":true,"landing_page_url":"https://hdl.handle.net/1721.1/146446","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM","raw_type":"http://purl.org/eprint/type/ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:dspace.mit.edu:1721.1/146446","doi":null,"is_oa":true,"landing_page_url":"https://hdl.handle.net/1721.1/146446","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM","raw_type":"http://purl.org/eprint/type/ConferencePaper"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":56,"referenced_works":["https://openalex.org/W30435042","https://openalex.org/W160678529","https://openalex.org/W1520740947","https://openalex.org/W1527104720","https://openalex.org/W1530560842","https://openalex.org/W1608550999","https://openalex.org/W1638683514","https://openalex.org/W1823654214","https://openalex.org/W1903894141","https://openalex.org/W1963633992","https://openalex.org/W1967570846","https://openalex.org/W1969573308","https://openalex.org/W1969916852","https://openalex.org/W1971937094","https://openalex.org/W1979740015","https://openalex.org/W1981234161","https://openalex.org/W1988067232","https://openalex.org/W1995725694","https://openalex.org/W1996014455","https://openalex.org/W2001907516","https://openalex.org/W2019150902","https://openalex.org/W2021243849","https://openalex.org/W2022980325","https://openalex.org/W2026042206","https://openalex.org/W2028341270","https://openalex.org/W2033961328","https://openalex.org/W2038073775","https://openalex.org/W2047489708","https://openalex.org/W2049500052","https://openalex.org/W2064790310","https://openalex.org/W2065105907","https://openalex.org/W2066999271","https://openalex.org/W2070263216","https://openalex.org/W2073094163","https://openalex.org/W2075577372","https://openalex.org/W2084224084","https://openalex.org/W2084803275","https://openalex.org/W2095293504","https://openalex.org/W2096594665","https://openalex.org/W2098207812","https://openalex.org/W2102750402","https://openalex.org/W2120248756","https://openalex.org/W2120783268","https://openalex.org/W2128393152","https://openalex.org/W2130790725","https://openalex.org/W2132275989","https://openalex.org/W2146507303","https://openalex.org/W2150123893","https://openalex.org/W2151400766","https://openalex.org/W2151827175","https://openalex.org/W2169528473","https://openalex.org/W2171707538","https://openalex.org/W2264676752","https://openalex.org/W2567974767","https://openalex.org/W3022326557","https://openalex.org/W4214773521"],"related_works":["https://openalex.org/W2944829845","https://openalex.org/W4417163915","https://openalex.org/W1946850312","https://openalex.org/W7099590350","https://openalex.org/W4324133499","https://openalex.org/W3098284691","https://openalex.org/W7097464265","https://openalex.org/W2525909498","https://openalex.org/W2567974767","https://openalex.org/W4211173878"],"abstract_inverted_index":{"Measuring":[0],"the":[1,14,32,39,49,60,63,75,78,85,93,106,114,133,146,149,157,172,178,204,207,283,294],"importance":[2],"of":[3,16,34,41,62,67,77,88,95,109,135,151,163,175,206,254,264,285],"a":[4,7,10,42,45,68,71,89,110,152,164,248,258],"node":[5,35,46,55,72,90,111,166],"in":[6,13,132,171,177,303],"network":[8],"is":[9,44,59,70,113,182,221,272],"major":[11],"goal":[12],"analysis":[15],"social":[17],"networks,":[18],"biological":[19],"systems,":[20],"transportation":[21],"networks":[22],"etc.":[23],"Different":[24],"centrality":[25,87,108,161,209,297],"measures":[26,92],"have":[27,99],"been":[28],"proposed":[29],"to":[30,52,80,144,155,211,244,274],"capture":[31],"notion":[33],"importance.":[36],"For":[37],"example,":[38],"center":[40,147],"graph":[43,69],"that":[47,73,98,119,233,247,269],"minimizes":[48,74],"maximum":[50],"distance":[51,58,116],"any":[53,120,253,290],"other":[54,82],"(the":[56],"latter":[57],"radius":[61,136],"graph).":[64],"The":[65,140,279],"median":[66,150],"sum":[76],"distances":[79],"all":[81,263],"nodes.":[83],"Informally,":[84],"betweenness":[86,158],"w":[91,100,112,126],"fraction":[94],"shortest":[96,122],"paths":[97],"as":[101],"an":[102],"intermediate":[103],"node.":[104],"Finally,":[105],"reach":[107,160],"smallest":[115],"r":[117,137],"such":[118],"s-t":[121],"path":[123],"passing":[124],"through":[125],"has":[127],"either":[128],"s":[129],"or":[130,159],"t":[131],"ball":[134],"around":[138],"w.":[139],"fastest":[141],"known":[142],"algorithms":[143,192],"compute":[145,156],"and":[148,154,229,236],"graph,":[153],"even":[162,307],"single":[165],"take":[167],"roughly":[168],"cubic":[169,312],"time":[170,195],"number":[173],"n":[174],"nodes":[176],"input":[179],"graph.":[180],"It":[181],"open":[183],"whether":[184],"these":[185,255],"problems":[186,214,256,298],"admit":[187],"truly":[188,218,249,259,304],"subcubic":[189,219,242,250,260,277,305],"algorithms,":[190],"i.e.":[191,246],"with":[193],"running":[194],"O\u0303(n3\u2212\u03b4)":[196],"for":[197,215,252,262,282],"some":[198],"constant":[199,291],"\u03b4>":[200],"01.":[201],"We":[202,231,266],"relate":[203],"complexity":[205],"mentioned":[208],"prob-lems":[210],"two":[212,296],"classical":[213],"which":[216],"no":[217],"al-gorithm":[220],"known,":[222],"namely":[223],"All":[224],"Pairs":[225],"Shortest":[226],"Paths":[227],"(APSP)":[228],"Diameter.":[230],"show":[232,268],"Radius,":[234],"Median":[235],"Betweenness":[237,287],"Cen-trality":[238],"are":[239],"equivalent":[240,273],"under":[241,276],"reductions":[243],"APSP,":[245],"algorithm":[251,261],"im-plies":[257],"them.":[265],"then":[267],"Reach":[270],"Centrality":[271,288],"Diameter":[275],"reductions.":[278],"same":[280],"holds":[281],"problem":[284],"approximating":[286],"within":[289],"factor.":[292],"Thus":[293],"lat-ter":[295],"could":[299],"potentially":[300],"be":[301],"solved":[302],"time,":[306],"if":[308],"APSP":[309],"requires":[310],"essentially":[311],"time.":[313],"1":[314]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":13},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":19},{"year":2015,"cited_by_count":6}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}