{"id":"https://openalex.org/W3044696671","doi":"https://doi.org/10.1007/978-3-030-53262-8_21","title":"On Finding Shortest Paths in Arc-Dependent Networks","display_name":"On Finding Shortest Paths in Arc-Dependent Networks","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3044696671","doi":"https://doi.org/10.1007/978-3-030-53262-8_21","mag":"3044696671"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-53262-8_21","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-53262-8_21","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/A5072083212","display_name":"Piotr Wojciechowski","orcid":"https://orcid.org/0000-0003-1684-1077"},"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":false,"raw_author_name":"P. Wojciechowski","raw_affiliation_strings":["LDCSEE, West Virginia University, Morgantown, WV, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LDCSEE, West Virginia University, Morgantown, WV, USA","institution_ids":["https://openalex.org/I12097938"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025214922","display_name":"Matthew Williamson","orcid":null},"institutions":[{"id":"https://openalex.org/I81726945","display_name":"Marietta College","ror":"https://ror.org/03apb0g70","country_code":"US","type":"education","lineage":["https://openalex.org/I81726945"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Matthew Williamson","raw_affiliation_strings":["MCS, Marietta College, Marietta, OH, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MCS, Marietta College, Marietta, OH, USA","institution_ids":["https://openalex.org/I81726945"]}]},{"author_position":"last","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":false,"raw_author_name":"K. Subramani","raw_affiliation_strings":["LDCSEE, West Virginia University, Morgantown, WV, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LDCSEE, West Virginia University, Morgantown, WV, USA","institution_ids":["https://openalex.org/I12097938"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.7399,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.67394617,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"249","last_page":"260"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.972000002861023,"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.972000002861023,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.9563000202178955,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9458000063896179,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7949627637863159},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.663428783416748},{"id":"https://openalex.org/keywords/arc","display_name":"Arc (geometry)","score":0.6467539668083191},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.606930136680603},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.5987319946289062},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.5441644191741943},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.499969482421875},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.4990057945251465},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.46274808049201965},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4617149829864502},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4420488476753235},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41306623816490173},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4076560139656067},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33173850178718567},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2918781042098999},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.09363678097724915},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08756762742996216}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7949627637863159},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.663428783416748},{"id":"https://openalex.org/C83415579","wikidata":"https://www.wikidata.org/wiki/Q161973","display_name":"Arc (geometry)","level":2,"score":0.6467539668083191},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.606930136680603},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.5987319946289062},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.5441644191741943},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.499969482421875},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.4990057945251465},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.46274808049201965},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4617149829864502},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4420488476753235},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41306623816490173},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4076560139656067},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33173850178718567},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2918781042098999},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.09363678097724915},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08756762742996216},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-030-53262-8_21","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-53262-8_21","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":[{"score":0.4000000059604645,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1969186119","https://openalex.org/W2020147819","https://openalex.org/W2060484689","https://openalex.org/W2085946783","https://openalex.org/W2091662631","https://openalex.org/W2098154640","https://openalex.org/W2169528473","https://openalex.org/W2341171179","https://openalex.org/W2486715098"],"related_works":["https://openalex.org/W2156431668","https://openalex.org/W2360981904","https://openalex.org/W4293054712","https://openalex.org/W4200172719","https://openalex.org/W2198982833","https://openalex.org/W2019018557","https://openalex.org/W2030169809","https://openalex.org/W2305559042","https://openalex.org/W2120070962","https://openalex.org/W2348504720"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}