{"id":"https://openalex.org/W2110452945","doi":"https://doi.org/10.1007/978-3-540-70918-3_3","title":"Speed-Up Techniques for Shortest-Path Computations","display_name":"Speed-Up Techniques for Shortest-Path Computations","publication_year":2007,"publication_date":"2007-05-23","ids":{"openalex":"https://openalex.org/W2110452945","doi":"https://doi.org/10.1007/978-3-540-70918-3_3","mag":"2110452945"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-70918-3_3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-70918-3_3","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/A5045460793","display_name":"Dorothea Wagner","orcid":"https://orcid.org/0000-0002-9141-7076"},"institutions":[{"id":"https://openalex.org/I102335020","display_name":"Karlsruhe Institute of Technology","ror":"https://ror.org/04t3en479","country_code":"DE","type":"education","lineage":["https://openalex.org/I102335020","https://openalex.org/I1305996414"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Dorothea Wagner","raw_affiliation_strings":["Universit\u00e4t Karlsruhe (TH), Fakult\u00e4t f\u00fcr Informatik, Institut f\u00fcr Theoretische Informatik, D-76128 Karlsruhe,","Universit\u00e4t Karlsruhe, Fakult\u00e4t f\u00fcr Informatik, Institut f\u00fcr Theoretische Informatik, Karlsruhe#TAB#"],"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Karlsruhe (TH), Fakult\u00e4t f\u00fcr Informatik, Institut f\u00fcr Theoretische Informatik, D-76128 Karlsruhe,","institution_ids":["https://openalex.org/I102335020"]},{"raw_affiliation_string":"Universit\u00e4t Karlsruhe, Fakult\u00e4t f\u00fcr Informatik, Institut f\u00fcr Theoretische Informatik, Karlsruhe#TAB#","institution_ids":["https://openalex.org/I102335020"]}]},{"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/I102335020","display_name":"Karlsruhe Institute of Technology","ror":"https://ror.org/04t3en479","country_code":"DE","type":"education","lineage":["https://openalex.org/I102335020","https://openalex.org/I1305996414"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Thomas Willhalm","raw_affiliation_strings":["Universit\u00e4t Karlsruhe (TH), Fakult\u00e4t f\u00fcr Informatik, Institut f\u00fcr Theoretische Informatik, D-76128 Karlsruhe,","Universit\u00e4t Karlsruhe, Fakult\u00e4t f\u00fcr Informatik, Institut f\u00fcr Theoretische Informatik, Karlsruhe#TAB#"],"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Karlsruhe (TH), Fakult\u00e4t f\u00fcr Informatik, Institut f\u00fcr Theoretische Informatik, D-76128 Karlsruhe,","institution_ids":["https://openalex.org/I102335020"]},{"raw_affiliation_string":"Universit\u00e4t Karlsruhe, Fakult\u00e4t f\u00fcr Informatik, Institut f\u00fcr Theoretische Informatik, Karlsruhe#TAB#","institution_ids":["https://openalex.org/I102335020"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5045460793"],"corresponding_institution_ids":["https://openalex.org/I102335020"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":6.8188,"has_fulltext":false,"cited_by_count":82,"citation_normalized_percentile":{"value":0.97510373,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"23","last_page":"36"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9991000294685364,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9898999929428101,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.8776893019676208},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.8759102821350098},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.749862551689148},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.676630973815918},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6031603217124939},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5816700458526611},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5704507231712341},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.5300602316856384},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5134278535842896},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.4950520098209381},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.45711588859558105},{"id":"https://openalex.org/keywords/graph-traversal","display_name":"Graph traversal","score":0.4487419128417969},{"id":"https://openalex.org/keywords/pathfinding","display_name":"Pathfinding","score":0.4335516393184662},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36003386974334717},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.19906169176101685},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12399953603744507},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.11081203818321228},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.06342947483062744}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.8776893019676208},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.8759102821350098},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.749862551689148},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.676630973815918},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6031603217124939},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5816700458526611},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5704507231712341},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.5300602316856384},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5134278535842896},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.4950520098209381},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45711588859558105},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.4487419128417969},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.4335516393184662},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36003386974334717},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.19906169176101685},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12399953603744507},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.11081203818321228},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.06342947483062744},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-540-70918-3_3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-70918-3_3","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:CiteSeerX.psu:10.1.1.164.6366","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.164.6366","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://i11www.ira.uka.de/extra/publications/ww-sutsp-07.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":50,"referenced_works":["https://openalex.org/W127515624","https://openalex.org/W175307687","https://openalex.org/W1493214567","https://openalex.org/W1520740947","https://openalex.org/W1528485123","https://openalex.org/W1539048696","https://openalex.org/W1550136763","https://openalex.org/W1559814459","https://openalex.org/W1561240874","https://openalex.org/W1583434898","https://openalex.org/W1587851010","https://openalex.org/W1597203970","https://openalex.org/W1799626923","https://openalex.org/W1827234103","https://openalex.org/W1866249310","https://openalex.org/W1969483458","https://openalex.org/W2000856020","https://openalex.org/W2007687856","https://openalex.org/W2014889099","https://openalex.org/W2022980325","https://openalex.org/W2058605898","https://openalex.org/W2077383738","https://openalex.org/W2084224084","https://openalex.org/W2085917651","https://openalex.org/W2091635795","https://openalex.org/W2101923813","https://openalex.org/W2103776069","https://openalex.org/W2118169763","https://openalex.org/W2149964853","https://openalex.org/W2151400766","https://openalex.org/W2152545366","https://openalex.org/W2153752762","https://openalex.org/W2156153879","https://openalex.org/W2166542580","https://openalex.org/W2169528473","https://openalex.org/W2184615329","https://openalex.org/W2261186745","https://openalex.org/W2405878055","https://openalex.org/W2439405256","https://openalex.org/W2486038297","https://openalex.org/W2494779131","https://openalex.org/W2499843863","https://openalex.org/W2501059503","https://openalex.org/W2506178054","https://openalex.org/W2561675875","https://openalex.org/W2895284333","https://openalex.org/W4210777595","https://openalex.org/W4285719527","https://openalex.org/W6686437712","https://openalex.org/W6718072680"],"related_works":["https://openalex.org/W4285687848","https://openalex.org/W223921116","https://openalex.org/W2982088850","https://openalex.org/W3216780016","https://openalex.org/W4402599120","https://openalex.org/W78690942","https://openalex.org/W4221129498","https://openalex.org/W2887026015","https://openalex.org/W2361442013","https://openalex.org/W2886722595"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":8}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}