{"id":"https://openalex.org/W3022326557","doi":"https://doi.org/10.1137/08071990x","title":"More Algorithms for All-Pairs Shortest Paths in Weighted Graphs","display_name":"More Algorithms for All-Pairs Shortest Paths in Weighted Graphs","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W3022326557","doi":"https://doi.org/10.1137/08071990x","mag":"3022326557"},"language":"en","primary_location":{"id":"doi:10.1137/08071990x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/08071990x","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032955418","display_name":"Timothy M. Chan","orcid":"https://orcid.org/0000-0002-8093-0675"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Timothy M. Chan","raw_affiliation_strings":["School of Computer Science, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada","institution_ids":["https://openalex.org/I151746483"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5032955418"],"corresponding_institution_ids":["https://openalex.org/I151746483"],"apc_list":null,"apc_paid":null,"fwci":7.8589,"has_fulltext":false,"cited_by_count":113,"citation_normalized_percentile":{"value":0.97876826,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":100},"biblio":{"volume":"39","issue":"5","first_page":"2075","last_page":"2089"},"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.9998000264167786,"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.9998000264167786,"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.9995999932289124,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.995199978351593,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/combinatorics","display_name":"Combinatorics","score":0.8118938207626343},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7197859883308411},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5923338532447815},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.527490496635437},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5269898772239685},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.49003803730010986},{"id":"https://openalex.org/keywords/matrix-multiplication","display_name":"Matrix multiplication","score":0.4517102837562561},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.42602798342704773},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4014143943786621},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.289376437664032},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.10031569004058838}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8118938207626343},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7197859883308411},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5923338532447815},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.527490496635437},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5269898772239685},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.49003803730010986},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.4517102837562561},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.42602798342704773},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4014143943786621},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.289376437664032},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.10031569004058838},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/08071990x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/08071990x","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1969573308","https://openalex.org/W1972978715","https://openalex.org/W1999222448","https://openalex.org/W2006570180","https://openalex.org/W2009283111","https://openalex.org/W2021227709","https://openalex.org/W2028341270","https://openalex.org/W2033961328","https://openalex.org/W2040746822","https://openalex.org/W2049153008","https://openalex.org/W2049500052","https://openalex.org/W2058426370","https://openalex.org/W2060919812","https://openalex.org/W2065105907","https://openalex.org/W2072064573","https://openalex.org/W2076014803","https://openalex.org/W2077383738","https://openalex.org/W2081442360","https://openalex.org/W2085524666","https://openalex.org/W2114365471","https://openalex.org/W2150256023","https://openalex.org/W2296148711","https://openalex.org/W2568603896","https://openalex.org/W2618199688","https://openalex.org/W2623873233","https://openalex.org/W4235042979"],"related_works":["https://openalex.org/W238609530","https://openalex.org/W2734192830","https://openalex.org/W3016395638","https://openalex.org/W1636163329","https://openalex.org/W4292947165","https://openalex.org/W3045121788","https://openalex.org/W3201655533","https://openalex.org/W3134442314","https://openalex.org/W2281248943","https://openalex.org/W3102538728"],"abstract_inverted_index":{"In":[0,35],"the":[1,5,9,36,40,62,71,108,119,142],"first":[2,120],"part":[3,38],"of":[4,39,57,64,70,73,84,112],"paper,":[6,41],"we":[7,42,89],"reexamine":[8],"all-pairs":[10,143],"shortest":[11,145],"path":[12,146],"(APSP)":[13],"problem":[14,147],"and":[15,115],"present":[16],"a":[17,54,68,85,91],"new":[18],"algorithm":[19],"with":[20],"running":[21],"time":[22,92],"$O(n^3\\log^3\\log":[23],"n/\\log^2n)$,":[24],"which":[25],"improves":[26],"all":[27],"known":[28],"algorithms":[29,52],"for":[30,53,78,127,141,148],"general":[31],"real-weighted":[32],"dense":[33],"graphs.":[34,150],"second":[37],"use":[43],"fast":[44],"matrix":[45],"multiplication":[46],"to":[47],"obtain":[48,90],"truly":[49,121],"subcubic":[50,122],"APSP":[51,128],"large":[55],"class":[56],"\u201cgeometrically":[58],"weighted\u201d":[59],"graphs,":[60,114,131],"where":[61,96],"weight":[63],"an":[65,135],"edge":[66],"is":[67,102],"function":[69],"coordinates":[72],"its":[74],"vertices.":[75],"For":[76],"example,":[77],"graphs":[79],"embedded":[80],"in":[81,98,129],"Euclidean":[82],"space":[83],"constant":[86],"dimension":[87],"d,":[88],"bound":[93],"near":[94],"$O(n^{3-(3-\\omega)/(2d+4)})$,":[95],"$\\omega<2.376$;":[97],"two":[99],"dimensions,":[100],"this":[101],"$O(n^{2.922})$.":[103],"Our":[104],"framework":[105],"greatly":[106],"extends":[107],"previously":[109],"considered":[110],"case":[111],"small\u2013integer-weighted":[113,149],"incidentally":[116],"also":[117],"yields":[118],"result":[123,137],"(near":[124,138],"$O(n^{3-(3-\\omega)/4})=O(n^{2.844})$":[125],"time)":[126,140],"real\u2013vertex-weighted":[130],"as":[132,134],"well":[133],"improved":[136],"$O(n^{(3+\\omega)/2})=O(n^{2.688})$":[139],"lightest":[144]},"counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":9},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":11},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":13},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":9},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":7}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}