{"id":"https://openalex.org/W2952145773","doi":"https://doi.org/10.48550/arxiv.1212.6327","title":"Speeding up shortest path algorithms","display_name":"Speeding up shortest path algorithms","publication_year":2012,"publication_date":"2012-12-27","ids":{"openalex":"https://openalex.org/W2952145773","doi":"https://doi.org/10.48550/arxiv.1212.6327","mag":"2952145773"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:1212.6327","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/1212.6327","pdf_url":"https://arxiv.org/pdf/1212.6327","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"volume":null,"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1212.6327","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050751131","display_name":"Andrej Brodnik","orcid":"https://orcid.org/0000-0001-9773-0664","observed_orcids":["https://orcid.org/0000-0001-9773-0664"]},"institutions":[{"id":"https://openalex.org/I118905719","display_name":"University of Primorska","ror":"https://ror.org/05xefg082","country_code":"SI","type":"education","lineage":["https://openalex.org/I118905719"]},{"id":"https://openalex.org/I153976015","display_name":"University of Ljubljana","ror":"https://ror.org/05njb9z20","country_code":"SI","type":"education","lineage":["https://openalex.org/I153976015"]}],"countries":["SI"],"is_corresponding":false,"raw_author_name":"Brodnik, Andrej","raw_affiliation_strings":["University of Ljubljana , Faculty of Computer and Information Science , Slovenia ,","University of Ljubljana","University of Primorska"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Ljubljana , Faculty of Computer and Information Science , Slovenia ,","institution_ids":["https://openalex.org/I153976015"]},{"raw_affiliation_string":"University of Ljubljana","institution_ids":["https://openalex.org/I153976015"]},{"raw_affiliation_string":"University of Primorska","institution_ids":["https://openalex.org/I118905719"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007225137","display_name":"Marko Grgurovi\u010d","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I118905719","display_name":"University of Primorska","ror":"https://ror.org/05xefg082","country_code":"SI","type":"education","lineage":["https://openalex.org/I118905719"]}],"countries":["SI"],"is_corresponding":false,"raw_author_name":"Grgurovi\u010d, Marko","raw_affiliation_strings":["University of Primorska , Department of Information Science and Technology , Slovenia ,","University of Primorska"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Primorska , Department of Information Science and Technology , Slovenia ,","institution_ids":["https://openalex.org/I118905719"]},{"raw_affiliation_string":"University of Primorska","institution_ids":["https://openalex.org/I118905719"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"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":1.0,"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":1.0,"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":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/all-pairs-shortest-paths","display_name":"all-pairs shortest paths","score":0.9330000281333923},{"id":"https://openalex.org/keywords/single-source-shortest-path","display_name":"single-source shortest path","score":0.8650000095367432},{"id":"https://openalex.org/keywords/directed-graphs","display_name":"directed graphs","score":0.8080000281333923},{"id":"https://openalex.org/keywords/non-negative-edge-weights","display_name":"non-negative edge weights","score":0.8090000152587891},{"id":"https://openalex.org/keywords/directed-acyclic-graphs","display_name":"directed acyclic graphs","score":0.9089999794960022},{"id":"https://openalex.org/keywords/time-complexity","display_name":"time complexity","score":0.5019999742507935}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7900376319885254},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7288876175880432},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.6280790567398071},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5403225421905518},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.532709538936615},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5215461254119873},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.45872068405151367},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45286908745765686},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.43041059374809265},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.4259496331214905},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34294041991233826},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2925870418548584},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:arXiv.org:1212.6327","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/1212.6327","pdf_url":"https://arxiv.org/pdf/1212.6327","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"mag:2952145773","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1212.6327v1","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.750.8007","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.750.8007","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1212.6327.pdf","raw_type":"text"},{"id":"doi:10.48550/arxiv.1212.6327","doi":"https://doi.org/10.48550/arxiv.1212.6327","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1212.6327","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1212.6327","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/1212.6327","pdf_url":"https://arxiv.org/pdf/1212.6327","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1567047166","https://openalex.org/W1969357318","https://openalex.org/W1969573308","https://openalex.org/W1991778515","https://openalex.org/W1999545213","https://openalex.org/W2008034501","https://openalex.org/W2022980325","https://openalex.org/W2065105907","https://openalex.org/W2084224084","https://openalex.org/W2133768189","https://openalex.org/W2169528473"],"related_works":["https://openalex.org/W1991063612","https://openalex.org/W2078948975","https://openalex.org/W2010601538","https://openalex.org/W2048824634","https://openalex.org/W2084623271","https://openalex.org/W3098654413","https://openalex.org/W2026890693","https://openalex.org/W2164059040","https://openalex.org/W1608550999","https://openalex.org/W3011341561","https://openalex.org/W1568092560","https://openalex.org/W2531762745","https://openalex.org/W2022086557","https://openalex.org/W1527132663","https://openalex.org/W2887468875","https://openalex.org/W1527270374","https://openalex.org/W2963978918","https://openalex.org/W2950456228","https://openalex.org/W1987669032","https://openalex.org/W1900943336"],"abstract_inverted_index":{"Given":[0],"an":[1,10,49,113],"arbitrary,":[2],"non-negatively":[3],"weighted,":[4],"directed":[5,125],"graph":[6],"$G=(V,E)$":[7],"we":[8,79,130],"present":[9],"algorithm":[11,50,78,122],"that":[12,72],"computes":[13],"all":[14],"pairs":[15],"shortest":[16,39,55,120,146],"paths":[17,40,147],"in":[18,38,74,94,112],"time":[19,47],"$\\mathcal{O}(m^*":[20],"n":[21,25],"+":[22,26,115],"m":[23,116],"\\lg":[24,117],"nT_\u03c8(m^*,":[27],"n))$,":[28],"where":[29],"$m^*$":[30],"is":[31,44,60],"the":[32,137],"number":[33],"of":[34,48,70,96,102,139],"different":[35],"edges":[36],"contained":[37],"and":[41,86,108,148],"$T_\u03c8(m^*,":[42],"n)$":[43,118],"a":[45,53,61,65,83,100,134,140],"running":[46],"to":[51],"solve":[52],"single-source":[54],"path":[56,121],"problem":[57,143],"(SSSP).":[58],"This":[59],"substantial":[62],"improvement":[63,89,95],"over":[64],"trivial":[66],"$n$":[67],"times":[68],"application":[69],"$\u03c8$":[71,81,91],"runs":[73],"$\\mathcal{O}(nT_\u03c8(m,n))$.":[75],"In":[76,128],"our":[77,97,103],"use":[80],"as":[82],"black":[84],"box":[85],"hence":[87],"any":[88],"on":[90,145],"results":[92,111],"also":[93,131],"algorithm.":[98],"Furthermore,":[99],"combination":[101],"method,":[104],"Johnson's":[105],"reweighting":[106],"technique":[107],"topological":[109],"sorting":[110,142],"$\\mathcal{O}(m^*n":[114],"all-pairs":[119],"for":[123],"arbitrarily-weighted":[124],"acyclic":[126],"graphs.":[127],"addition,":[129],"point":[132],"out":[133],"connection":[135],"between":[136],"complexity":[138],"certain":[141],"defined":[144],"SSSP.":[149]},"counts_by_year":[],"updated_date":"2026-09-30T09:27:27.532063","created_date":"2025-10-10T00:00:00"}