{"id":"https://openalex.org/W1708444016","doi":"https://doi.org/10.1007/978-3-540-30551-4_74","title":"Efficient Algorithms for the Longest Path Problem","display_name":"Efficient Algorithms for the Longest Path Problem","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W1708444016","doi":"https://doi.org/10.1007/978-3-540-30551-4_74","mag":"1708444016"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-30551-4_74","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-30551-4_74","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/A5054829031","display_name":"Ryuhei Uehara","orcid":"https://orcid.org/0000-0003-0895-3765"},"institutions":[{"id":"https://openalex.org/I177738480","display_name":"Japan Advanced Institute of Science and Technology","ror":"https://ror.org/03frj4r98","country_code":"JP","type":"education","lineage":["https://openalex.org/I177738480"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Ryuhei Uehara","raw_affiliation_strings":["Department of Information Processing, School of Information Science, JAIST, Ishikawa, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Processing, School of Information Science, JAIST, Ishikawa, Japan","institution_ids":["https://openalex.org/I177738480"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062599134","display_name":"Yushi Uno","orcid":null},"institutions":[{"id":"https://openalex.org/I15807432","display_name":"Osaka Prefecture University","ror":"https://ror.org/02cf1je33","country_code":"JP","type":"education","lineage":["https://openalex.org/I15807432"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yushi Uno","raw_affiliation_strings":["Department of Mathematics and Information Science, College of Integrated Arts and Sciences, Osaka Prefecture University, Sakai, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Information Science, College of Integrated Arts and Sciences, Osaka Prefecture University, Sakai, Japan","institution_ids":["https://openalex.org/I15807432"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.1014,"has_fulltext":false,"cited_by_count":70,"citation_normalized_percentile":{"value":0.78792299,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"871","last_page":"883"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9922999739646912,"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/T11106","display_name":"Data Management and Algorithms","score":0.989799976348877,"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/longest-path-problem","display_name":"Longest path problem","score":0.7929827570915222},{"id":"https://openalex.org/keywords/hamiltonian-path-problem","display_name":"Hamiltonian path problem","score":0.6084129810333252},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.579879105091095},{"id":"https://openalex.org/keywords/corollary","display_name":"Corollary","score":0.5481165647506714},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.542253315448761},{"id":"https://openalex.org/keywords/widest-path-problem","display_name":"Widest path problem","score":0.532049298286438},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5228869318962097},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5093783140182495},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46627357602119446},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41713398694992065},{"id":"https://openalex.org/keywords/block-graph","display_name":"Block graph","score":0.4165094494819641},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3946729302406311},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3458496928215027},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.32706791162490845},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3248182535171509},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.26982060074806213},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.255537211894989},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.13845497369766235}],"concepts":[{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.7929827570915222},{"id":"https://openalex.org/C104737047","wikidata":"https://www.wikidata.org/wiki/Q987652","display_name":"Hamiltonian path problem","level":4,"score":0.6084129810333252},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.579879105091095},{"id":"https://openalex.org/C2780012671","wikidata":"https://www.wikidata.org/wiki/Q1343870","display_name":"Corollary","level":2,"score":0.5481165647506714},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.542253315448761},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.532049298286438},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5228869318962097},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5093783140182495},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46627357602119446},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41713398694992065},{"id":"https://openalex.org/C43413943","wikidata":"https://www.wikidata.org/wiki/Q4927193","display_name":"Block graph","level":5,"score":0.4165094494819641},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3946729302406311},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3458496928215027},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.32706791162490845},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3248182535171509},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.26982060074806213},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.255537211894989},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.13845497369766235},{"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/978-3-540-30551-4_74","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-30551-4_74","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W144954708","https://openalex.org/W1579049696","https://openalex.org/W1586904125","https://openalex.org/W1976157781","https://openalex.org/W1978041641","https://openalex.org/W1988098280","https://openalex.org/W1990313671","https://openalex.org/W1994680554","https://openalex.org/W2011039300","https://openalex.org/W2024491681","https://openalex.org/W2028363955","https://openalex.org/W2045021308","https://openalex.org/W2046496468","https://openalex.org/W2052982152","https://openalex.org/W2054420170","https://openalex.org/W2057556050","https://openalex.org/W2064110920","https://openalex.org/W2077143033","https://openalex.org/W2081608609","https://openalex.org/W2132624129","https://openalex.org/W2137560895","https://openalex.org/W2143474538","https://openalex.org/W2172129783","https://openalex.org/W2296148711","https://openalex.org/W2486715098","https://openalex.org/W2611804663","https://openalex.org/W2913688336","https://openalex.org/W4249318479","https://openalex.org/W4285719527","https://openalex.org/W4292230561"],"related_works":["https://openalex.org/W1618127724","https://openalex.org/W4387272283","https://openalex.org/W2768859505","https://openalex.org/W2256329187","https://openalex.org/W2952856011","https://openalex.org/W2046852387","https://openalex.org/W2036803675","https://openalex.org/W2127206007","https://openalex.org/W3207048296","https://openalex.org/W2012473793"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":5},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":4}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}