{"id":"https://openalex.org/W2132108235","doi":"https://doi.org/10.1007/978-3-540-27810-8_41","title":"Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths","display_name":"Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W2132108235","doi":"https://doi.org/10.1007/978-3-540-27810-8_41","mag":"2132108235"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-27810-8_41","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-27810-8_41","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/A5039943336","display_name":"Gerth St\u00f8lting Brodal","orcid":"https://orcid.org/0000-0001-9054-915X"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Gerth St\u00f8lting Brodal","raw_affiliation_strings":["BRICS, Department of Computer Science, University of Aarhus, DK-8000, \u00c5rhus\u00a0C, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"BRICS, Department of Computer Science, University of Aarhus, DK-8000, \u00c5rhus\u00a0C, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021765002","display_name":"Rolf Fagerberg","orcid":"https://orcid.org/0000-0003-1004-3314"},"institutions":[{"id":"https://openalex.org/I177969490","display_name":"University of Southern Denmark","ror":"https://ror.org/03yrrjy16","country_code":"DK","type":"education","lineage":["https://openalex.org/I177969490"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Rolf Fagerberg","raw_affiliation_strings":["Department of Mathematics and Computer Science, University of Southern Denmark, DK-5230, Odense\u00a0M, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Southern Denmark, DK-5230, Odense\u00a0M, Denmark","institution_ids":["https://openalex.org/I177969490"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103183708","display_name":"Ulrich Meyer","orcid":"https://orcid.org/0000-0002-1197-3153"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Ulrich Meyer","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik, 66123, Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, 66123, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019738080","display_name":"Norbert Zeh","orcid":"https://orcid.org/0000-0002-0562-1629"},"institutions":[{"id":"https://openalex.org/I129902397","display_name":"Dalhousie University","ror":"https://ror.org/01e6qks80","country_code":"CA","type":"education","lineage":["https://openalex.org/I129902397"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Norbert Zeh","raw_affiliation_strings":["Faculty of Computer Science, Dalhousie University, Halifax, NS, B3H 1W5, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science, Dalhousie University, Halifax, NS, B3H 1W5, Canada","institution_ids":["https://openalex.org/I129902397"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":6.3332,"has_fulltext":false,"cited_by_count":56,"citation_normalized_percentile":{"value":0.97782964,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"480","last_page":"492"},"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.9994000196456909,"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.9994000196456909,"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/T12288","display_name":"Optimization and Search Problems","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10237","display_name":"Cryptography and Data Security","score":0.9965000152587891,"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/computer-science","display_name":"Computer science","score":0.8634539842605591},{"id":"https://openalex.org/keywords/priority-queue","display_name":"Priority queue","score":0.728232741355896},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.6704472899436951},{"id":"https://openalex.org/keywords/heap","display_name":"Heap (data structure)","score":0.6547360420227051},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6192291378974915},{"id":"https://openalex.org/keywords/cache-oblivious-algorithm","display_name":"Cache-oblivious algorithm","score":0.46222010254859924},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.44300758838653564},{"id":"https://openalex.org/keywords/cache-algorithms","display_name":"Cache algorithms","score":0.43000638484954834},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42893102765083313},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.420251727104187},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3831399083137512},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.3215892016887665},{"id":"https://openalex.org/keywords/cpu-cache","display_name":"CPU cache","score":0.2774653434753418},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.16373080015182495},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.09982338547706604}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8634539842605591},{"id":"https://openalex.org/C26951474","wikidata":"https://www.wikidata.org/wiki/Q629283","display_name":"Priority queue","level":3,"score":0.728232741355896},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.6704472899436951},{"id":"https://openalex.org/C134757568","wikidata":"https://www.wikidata.org/wiki/Q274089","display_name":"Heap (data structure)","level":2,"score":0.6547360420227051},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6192291378974915},{"id":"https://openalex.org/C59687516","wikidata":"https://www.wikidata.org/wiki/Q5015938","display_name":"Cache-oblivious algorithm","level":5,"score":0.46222010254859924},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.44300758838653564},{"id":"https://openalex.org/C38556500","wikidata":"https://www.wikidata.org/wiki/Q13404475","display_name":"Cache algorithms","level":4,"score":0.43000638484954834},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42893102765083313},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.420251727104187},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3831399083137512},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.3215892016887665},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.2774653434753418},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.16373080015182495},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09982338547706604},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-540-27810-8_41","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-27810-8_41","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"},{"id":"pmh:oai:pure.atira.dk:publications/c1079930-83a7-11dc-bee9-02004c4f4f50","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/c1079930-83a7-11dc-bee9-02004c4f4f50","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Brodal, G S, Fagerberg, R, Meyer, U & Zeh, N 2004, Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths. in T Hagerup & J Katajainen (eds), Algorithm Theory - SWAT 2004 : 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004. Proceedings. Springer, Lecture Notes in Computer Science, vol. 3111, pp. 480-492, 9th Scandinavian Workshop on Algorithm Theory (SWAT'04), Humleb\u00e6k, Denmark, 08/07/2004. https://doi.org/10.1007/978-3-540-27810-8_41","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W358088974","https://openalex.org/W1485508724","https://openalex.org/W1487258612","https://openalex.org/W1556590257","https://openalex.org/W1591816673","https://openalex.org/W1592580490","https://openalex.org/W1986843945","https://openalex.org/W2014866763","https://openalex.org/W2022117185","https://openalex.org/W2034413563","https://openalex.org/W2038142281","https://openalex.org/W2046441184","https://openalex.org/W2057839002","https://openalex.org/W2084224084","https://openalex.org/W2090103608","https://openalex.org/W2095875205","https://openalex.org/W2097224604","https://openalex.org/W2100410715","https://openalex.org/W2105156747","https://openalex.org/W2136354771","https://openalex.org/W2141883265","https://openalex.org/W2164853667","https://openalex.org/W2169528473","https://openalex.org/W2561675875","https://openalex.org/W2945692662","https://openalex.org/W6629262294"],"related_works":["https://openalex.org/W1909000919","https://openalex.org/W2182210592","https://openalex.org/W1558482185","https://openalex.org/W2087629135","https://openalex.org/W4385965231","https://openalex.org/W2139241970","https://openalex.org/W1967362387","https://openalex.org/W1827355354","https://openalex.org/W2066113256","https://openalex.org/W2237203593"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}