{"id":"https://openalex.org/W2091635795","doi":"https://doi.org/10.1145/1187436.1216585","title":"Partitioning graphs to speedup Dijkstra's algorithm","display_name":"Partitioning graphs to speedup Dijkstra's algorithm","publication_year":2007,"publication_date":"2007-02-09","ids":{"openalex":"https://openalex.org/W2091635795","doi":"https://doi.org/10.1145/1187436.1216585","mag":"2091635795"},"language":"en","primary_location":{"id":"doi:10.1145/1187436.1216585","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1187436.1216585","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","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/A5001357515","display_name":"Rolf H. M\u00f6hring","orcid":"https://orcid.org/0000-0003-3766-8728"},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Rolf H. M\u00f6hring","raw_affiliation_strings":["Technische Universit\u00e4t Berlin, Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065364118","display_name":"Heiko Schilling","orcid":null},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Heiko Schilling","raw_affiliation_strings":["Technische Universit\u00e4t Berlin, Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029070973","display_name":"Birk Sch\u00fctz","orcid":null},"institutions":[{"id":"https://openalex.org/I4210119349","display_name":"Karlsruhe University of Education","ror":"https://ror.org/01t1kq612","country_code":"DE","type":"education","lineage":["https://openalex.org/I4210119349"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Birk Sch\u00fctz","raw_affiliation_strings":["Universit\u00e4t Karlsruhe (TH), Karlsruhe, Germany"],"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Karlsruhe (TH), Karlsruhe, Germany","institution_ids":["https://openalex.org/I4210119349"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045460793","display_name":"Dorothea Wagner","orcid":"https://orcid.org/0000-0002-9141-7076"},"institutions":[{"id":"https://openalex.org/I4210119349","display_name":"Karlsruhe University of Education","ror":"https://ror.org/01t1kq612","country_code":"DE","type":"education","lineage":["https://openalex.org/I4210119349"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Dorothea Wagner","raw_affiliation_strings":["Universit\u00e4t Karlsruhe (TH), Karlsruhe, Germany"],"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Karlsruhe (TH), Karlsruhe, Germany","institution_ids":["https://openalex.org/I4210119349"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010657180","display_name":"Thomas Willhalm","orcid":"https://orcid.org/0000-0001-8505-0936"},"institutions":[{"id":"https://openalex.org/I4210119349","display_name":"Karlsruhe University of Education","ror":"https://ror.org/01t1kq612","country_code":"DE","type":"education","lineage":["https://openalex.org/I4210119349"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Thomas Willhalm","raw_affiliation_strings":["Universit\u00e4t Karlsruhe (TH), Karlsruhe, Germany"],"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Karlsruhe (TH), Karlsruhe, Germany","institution_ids":["https://openalex.org/I4210119349"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5001357515"],"corresponding_institution_ids":["https://openalex.org/I4577782"],"apc_list":null,"apc_paid":null,"fwci":9.4959,"has_fulltext":false,"cited_by_count":130,"citation_normalized_percentile":{"value":0.98445048,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":"11","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10799","display_name":"Data Visualization and Analytics","score":0.9861000180244446,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9620000123977661,"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/speedup","display_name":"Speedup","score":0.9268007874488831},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.7856365442276001},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6594642400741577},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6405208110809326},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.6394863128662109},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.5842709541320801},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.566261887550354},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5620279312133789},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5570425391197205},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.33878666162490845},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.2694130837917328},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2528213858604431}],"concepts":[{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.9268007874488831},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.7856365442276001},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6594642400741577},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6405208110809326},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.6394863128662109},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.5842709541320801},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.566261887550354},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5620279312133789},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5570425391197205},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.33878666162490845},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.2694130837917328},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2528213858604431}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1187436.1216585","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1187436.1216585","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W30435042","https://openalex.org/W136556473","https://openalex.org/W175307687","https://openalex.org/W198029235","https://openalex.org/W1493214567","https://openalex.org/W1500924481","https://openalex.org/W1534124732","https://openalex.org/W1561240874","https://openalex.org/W1827234103","https://openalex.org/W1866249310","https://openalex.org/W1997413504","https://openalex.org/W2014889099","https://openalex.org/W2022980325","https://openalex.org/W2023031355","https://openalex.org/W2070232376","https://openalex.org/W2084224084","https://openalex.org/W2101923813","https://openalex.org/W2114734373","https://openalex.org/W2120424341","https://openalex.org/W2139539792","https://openalex.org/W2149964853","https://openalex.org/W2156153879","https://openalex.org/W2169528473","https://openalex.org/W2402598023","https://openalex.org/W2404629773","https://openalex.org/W3145128584","https://openalex.org/W4285719527","https://openalex.org/W6685290738"],"related_works":["https://openalex.org/W2381419702","https://openalex.org/W2810620529","https://openalex.org/W4253588386","https://openalex.org/W2372677512","https://openalex.org/W1562631103","https://openalex.org/W2348177054","https://openalex.org/W2170980056","https://openalex.org/W1508906807","https://openalex.org/W2147862592","https://openalex.org/W2387829241"],"abstract_inverted_index":{"We":[0,145],"study":[1,149],"an":[2,74,90,98,147,202],"acceleration":[3,21],"method":[4,22,87],"for":[5,141,157],"point-to-point":[6],"shortest-path":[7,56,143],"computations":[8],"in":[9],"large":[10,114],"and":[11,28,68,93,170],"sparse":[12],"directed":[13],"graphs":[14],"with":[15,89,224],"given":[16,83],"nonnegative":[17],"arc":[18,75,173],"weights.":[19],"The":[20,85,176,184],"is":[23,29,51,64,70,76],"called":[24],"the":[25,35,43,59,62,108,126,134,137,158,190,193,205,217,237,242,245],"arc-flag":[26,36,86,159],"approach":[27],"based":[30],"on":[31,72,77,113,180,189],"Dijkstra's":[32,130],"algorithm.":[33],"In":[34,58,161],"approach,":[37],"we":[38,163,200],"allow":[39],"a":[40,78,82,94,171,234],"preprocessing":[41,60],"of":[42,102,111,129,136,186,192,204,211,236,244],"network":[44],"data":[45,239],"to":[46,54,107,132,208],"generate":[47],"additional":[48],"information,":[49],"which":[50,152],"then":[52],"used":[53],"speedup":[55,100,191,206,219],"queries.":[57,144],"phase,":[61],"graph":[63],"divided":[65],"into":[66,81],"regions":[67],"information":[69],"gathered":[71],"whether":[73],"shortest":[79,139,194,247],"path":[80,140,195],"region.":[84],"combined":[88],"appropriate":[91],"partitioning":[92,165],"bidirected":[95],"search":[96,127],"achieves":[97],"average":[99],"factor":[101],"more":[103],"than":[104],"500":[105],"compared":[106],"standard":[109],"algorithm":[110,131,196],"Dijkstra":[112],"networks":[115],"(1":[116],"million":[117,120],"nodes,":[118],"2.5":[119],"arcs).":[121],"This":[122],"combination":[123],"narrows":[124],"down":[125],"space":[128,226],"almost":[133],"size":[135],"corresponding":[138],"long-distance":[142],"conduct":[146],"experimental":[148],"that":[150,240],"evaluates":[151],"partitionings":[153],"are":[154,197],"best":[155],"suited":[156],"method.":[160],"particular,":[162],"examine":[164],"algorithms":[166],"from":[167],"computational":[168],"geometry":[169],"multiway":[172],"separator":[174],"partitioning.":[175],"evaluation":[177],"was":[178],"done":[179],"German":[181],"road":[182],"networks.":[183],"impact":[185],"different":[187],"partitions":[188],"compared.":[198],"Furthermore,":[199],"present":[201],"extension":[203],"technique":[207],"multiple":[209],"levels":[210],"partitions.":[212],"With":[213],"this":[214],"multilevel":[215],"variant,":[216],"same":[218],"factors":[220],"can":[221],"be":[222,231],"achieved":[223],"smaller":[225],"requirements.":[227],"It":[228],"can,":[229],"therefore,":[230],"seen":[232],"as":[233],"compression":[235],"precomputed":[238],"preserves":[241],"correctness":[243],"computed":[246],"paths.":[248]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":10},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":15},{"year":2012,"cited_by_count":8}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}