{"id":"https://openalex.org/W2154828731","doi":"https://doi.org/10.1007/s00453-010-9402-4","title":"A Quadratic Algorithm for Finding Next-to-Shortest Paths in Graphs","display_name":"A Quadratic Algorithm for Finding Next-to-Shortest Paths in Graphs","publication_year":2010,"publication_date":"2010-03-04","ids":{"openalex":"https://openalex.org/W2154828731","doi":"https://doi.org/10.1007/s00453-010-9402-4","mag":"2154828731"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-010-9402-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-010-9402-4","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","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/A5075779509","display_name":"Kuo-Hua Kao","orcid":null},"institutions":[{"id":"https://openalex.org/I193365169","display_name":"National Chi Nan University","ror":"https://ror.org/03ha6v181","country_code":"TW","type":"education","lineage":["https://openalex.org/I193365169"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Kuo-Hua Kao","raw_affiliation_strings":["Department of Computer Science and Information Engineering, National Chi Nan University, Nantou, Taiwan, ROC"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Engineering, National Chi Nan University, Nantou, Taiwan, ROC","institution_ids":["https://openalex.org/I193365169"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049607435","display_name":"Jou\u2013Ming Chang","orcid":"https://orcid.org/0000-0002-9542-7968"},"institutions":[{"id":"https://openalex.org/I43566213","display_name":"National Taipei University of Business","ror":"https://ror.org/029hrv109","country_code":"TW","type":"education","lineage":["https://openalex.org/I43566213"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Jou-Ming Chang","raw_affiliation_strings":["Institute of Information Science and Management, National Taipei College of Business, Taipei, Taiwan, ROC"],"affiliations":[{"raw_affiliation_string":"Institute of Information Science and Management, National Taipei College of Business, Taipei, Taiwan, ROC","institution_ids":["https://openalex.org/I43566213"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5115590756","display_name":"Yue-Li Wang","orcid":null},"institutions":[{"id":"https://openalex.org/I154864474","display_name":"National Taiwan University of Science and Technology","ror":"https://ror.org/00q09pe49","country_code":"TW","type":"education","lineage":["https://openalex.org/I154864474"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Yue-Li Wang","raw_affiliation_strings":["Department of Information Management, National Taiwan University of Science and Technology, Taipei, Taiwan, ROC"],"affiliations":[{"raw_affiliation_string":"Department of Information Management, National Taiwan University of Science and Technology, Taipei, Taiwan, ROC","institution_ids":["https://openalex.org/I154864474"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5036652639","display_name":"Justie Su-Tzu Juan","orcid":"https://orcid.org/0000-0002-3654-2560"},"institutions":[{"id":"https://openalex.org/I193365169","display_name":"National Chi Nan University","ror":"https://ror.org/03ha6v181","country_code":"TW","type":"education","lineage":["https://openalex.org/I193365169"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Justie Su-Tzu Juan","raw_affiliation_strings":["Department of Computer Science and Information Engineering, National Chi Nan University, Nantou, Taiwan, ROC"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Engineering, National Chi Nan University, Nantou, Taiwan, ROC","institution_ids":["https://openalex.org/I193365169"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5115590756"],"corresponding_institution_ids":["https://openalex.org/I154864474"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":1.7218,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.85277881,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"61","issue":"2","first_page":"402","last_page":"418"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9980999827384949,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9977999925613403,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.8314961194992065},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7854388952255249},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.6633784770965576},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.6191425323486328},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6133473515510559},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.5836381912231445},{"id":"https://openalex.org/keywords/widest-path-problem","display_name":"Widest path problem","score":0.5613617897033691},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.5507895350456238},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.5196769833564758},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.48905834555625916},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.47932183742523193},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.45035868883132935},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.41425031423568726},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4103131890296936},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.36526164412498474},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2884782552719116},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2173553705215454},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.16472920775413513}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8314961194992065},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7854388952255249},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.6633784770965576},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.6191425323486328},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6133473515510559},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.5836381912231445},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.5613617897033691},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.5507895350456238},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.5196769833564758},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.48905834555625916},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.47932183742523193},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.45035868883132935},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.41425031423568726},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4103131890296936},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.36526164412498474},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2884782552719116},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2173553705215454},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.16472920775413513},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00453-010-9402-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-010-9402-4","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1985676638","https://openalex.org/W2049105156","https://openalex.org/W2052950624","https://openalex.org/W2074459488","https://openalex.org/W2169528473","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2375775343","https://openalex.org/W2198982833","https://openalex.org/W4293054712","https://openalex.org/W2237480599","https://openalex.org/W2133099431","https://openalex.org/W2002764510","https://openalex.org/W4321491762","https://openalex.org/W2776102956","https://openalex.org/W2612665926","https://openalex.org/W4294360851"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}