{"id":"https://openalex.org/W1528287146","doi":"https://doi.org/10.1007/978-3-642-02026-1_17","title":"Two-Level Heaps: A New Priority Queue Structure with Applications to the Single Source Shortest Path Problem","display_name":"Two-Level Heaps: A New Priority Queue Structure with Applications to the Single Source Shortest Path Problem","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W1528287146","doi":"https://doi.org/10.1007/978-3-642-02026-1_17","mag":"1528287146"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-02026-1_17","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-02026-1_17","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5050337397","display_name":"K. Subramani","orcid":"https://orcid.org/0000-0001-5821-5117"},"institutions":[{"id":"https://openalex.org/I12097938","display_name":"West Virginia University","ror":"https://ror.org/011vxgd24","country_code":"US","type":"education","lineage":["https://openalex.org/I12097938"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"K. Subramani","raw_affiliation_strings":["LDCSEE, West Virginia University, Morgantown, WV 26506, USA"],"affiliations":[{"raw_affiliation_string":"LDCSEE, West Virginia University, Morgantown, WV 26506, USA","institution_ids":["https://openalex.org/I12097938"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5057403059","display_name":"Kamesh Madduri","orcid":"https://orcid.org/0000-0003-4344-0957"},"institutions":[{"id":"https://openalex.org/I148283060","display_name":"Lawrence Berkeley National Laboratory","ror":"https://ror.org/02jbv0t02","country_code":"US","type":"facility","lineage":["https://openalex.org/I1330989302","https://openalex.org/I148283060","https://openalex.org/I39565521"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kamesh Madduri","raw_affiliation_strings":["Computational Research Division, Lawrence Berkeley National Laboratory, Berkeley, CA 94720, USA"],"affiliations":[{"raw_affiliation_string":"Computational Research Division, Lawrence Berkeley National Laboratory, Berkeley, CA 94720, USA","institution_ids":["https://openalex.org/I148283060"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5050337397"],"corresponding_institution_ids":["https://openalex.org/I12097938"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.3288,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.61109965,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"186","last_page":"196"},"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.9997000098228455,"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.9997000098228455,"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.9994999766349792,"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/T11106","display_name":"Data Management and Algorithms","score":0.9991000294685364,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.8766974210739136},{"id":"https://openalex.org/keywords/priority-queue","display_name":"Priority queue","score":0.7854549884796143},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6786980628967285},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5410879850387573},{"id":"https://openalex.org/keywords/suurballes-algorithm","display_name":"Suurballe's algorithm","score":0.4974656403064728},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.4901888966560364},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.47643810510635376},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.4582386016845703},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.44595858454704285},{"id":"https://openalex.org/keywords/pathfinding","display_name":"Pathfinding","score":0.4336174726486206},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3848121166229248},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36637231707572937},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35021477937698364},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.34456902742385864},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.33730074763298035},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27505308389663696},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10229435563087463}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.8766974210739136},{"id":"https://openalex.org/C26951474","wikidata":"https://www.wikidata.org/wiki/Q629283","display_name":"Priority queue","level":3,"score":0.7854549884796143},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6786980628967285},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5410879850387573},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.4974656403064728},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.4901888966560364},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.47643810510635376},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.4582386016845703},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.44595858454704285},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.4336174726486206},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3848121166229248},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36637231707572937},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35021477937698364},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.34456902742385864},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.33730074763298035},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27505308389663696},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10229435563087463}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-642-02026-1_17","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-02026-1_17","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W1482680420","https://openalex.org/W1518101386","https://openalex.org/W1550136763","https://openalex.org/W1599325086","https://openalex.org/W2002560134","https://openalex.org/W2006132599","https://openalex.org/W2014206268","https://openalex.org/W2022980325","https://openalex.org/W2029706450","https://openalex.org/W2035266499","https://openalex.org/W2049354208","https://openalex.org/W2062266989","https://openalex.org/W2083669067","https://openalex.org/W2095352457","https://openalex.org/W2096594665","https://openalex.org/W2120424341","https://openalex.org/W2127620007","https://openalex.org/W2129776415","https://openalex.org/W2136706845","https://openalex.org/W2160365857","https://openalex.org/W2164049050","https://openalex.org/W2164141517","https://openalex.org/W2169528473","https://openalex.org/W2172262605","https://openalex.org/W3137299218","https://openalex.org/W3145128584","https://openalex.org/W4250915400","https://openalex.org/W4285719527","https://openalex.org/W4372046852"],"related_works":["https://openalex.org/W2348287729","https://openalex.org/W2810620529","https://openalex.org/W4253588386","https://openalex.org/W2163460271","https://openalex.org/W651485002","https://openalex.org/W2383519316","https://openalex.org/W2348177054","https://openalex.org/W2371911836","https://openalex.org/W2375333907","https://openalex.org/W2347883311"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}