{"id":"https://openalex.org/W2046496468","doi":"https://doi.org/10.1137/s0097539702416761","title":"Finding a Path of Superlogarithmic Length","display_name":"Finding a Path of Superlogarithmic Length","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W2046496468","doi":"https://doi.org/10.1137/s0097539702416761","mag":"2046496468"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539702416761","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539702416761","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://lup.lub.lu.se/record/526604","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5038787166","display_name":"Andreas Bj\u00f6rklund","orcid":"https://orcid.org/0009-0009-9303-9986"},"institutions":[{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Andreas Bj\u00f6rklund","raw_affiliation_strings":["Department of Computer Science, Lund University, Lund, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Lund University, Lund, Sweden","institution_ids":["https://openalex.org/I187531555"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041727204","display_name":"Thore Husfeldt","orcid":"https://orcid.org/0000-0001-9078-4512"},"institutions":[{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Thore Husfeldt","raw_affiliation_strings":["Department of Computer Science, Lund University, Lund, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Lund University, Lund, Sweden","institution_ids":["https://openalex.org/I187531555"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I187531555"],"apc_list":null,"apc_paid":null,"fwci":3.6001,"has_fulltext":false,"cited_by_count":48,"citation_normalized_percentile":{"value":0.93031679,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"32","issue":"6","first_page":"1395","last_page":"1402"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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.9994999766349792,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/combinatorics","display_name":"Combinatorics","score":0.8176737427711487},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.7348028421401978},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6767181754112244},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.6706238389015198},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6359308362007141},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5705171227455139},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5506892204284668},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.533841073513031},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.4787149429321289},{"id":"https://openalex.org/keywords/path-graph","display_name":"Path graph","score":0.46712949872016907},{"id":"https://openalex.org/keywords/path-length","display_name":"Path length","score":0.46670958399772644},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4658912420272827},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.4136062264442444},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.363653302192688},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.24515050649642944},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.16255095601081848},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.15720948576927185},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.10824665427207947},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.07782065868377686}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8176737427711487},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.7348028421401978},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6767181754112244},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.6706238389015198},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6359308362007141},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5705171227455139},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5506892204284668},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.533841073513031},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.4787149429321289},{"id":"https://openalex.org/C128067373","wikidata":"https://www.wikidata.org/wiki/Q1415372","display_name":"Path graph","level":5,"score":0.46712949872016907},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.46670958399772644},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4658912420272827},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.4136062264442444},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.363653302192688},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.24515050649642944},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.16255095601081848},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.15720948576927185},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.10824665427207947},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.07782065868377686},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1137/s0097539702416761","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539702416761","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.19.6462","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.6462","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.lth.se/~thore/papers/longestpath.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.861.8751","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.861.8751","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://lup.lub.lu.se/luur/download?fileOId%3D623761%26func%3DdownloadFile%26recordOId%3D526604","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.9.6288","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.6288","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.lth.se/~thore/papers/41676.pdf","raw_type":"text"},{"id":"pmh:oai:lup.lub.lu.se:06da6959-ea37-4b66-b805-0b5f2fbba17c","is_oa":false,"landing_page_url":"https://lup.lub.lu.se/record/294049","pdf_url":null,"source":{"id":"https://openalex.org/S4306400536","display_name":"Lund University Publications (Lund University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I187531555","host_organization_name":"Lund University","host_organization_lineage":["https://openalex.org/I187531555"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN: 0097-5397","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:lup.lub.lu.se:a503c905-dbed-490a-8de2-106f0ce8ae3b","is_oa":true,"landing_page_url":"https://lup.lub.lu.se/record/526604","pdf_url":null,"source":{"id":"https://openalex.org/S4306400536","display_name":"Lund University Publications (Lund University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I187531555","host_organization_name":"Lund University","host_organization_lineage":["https://openalex.org/I187531555"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferencePaper"}],"best_oa_location":{"id":"pmh:oai:lup.lub.lu.se:a503c905-dbed-490a-8de2-106f0ce8ae3b","is_oa":true,"landing_page_url":"https://lup.lub.lu.se/record/526604","pdf_url":null,"source":{"id":"https://openalex.org/S4306400536","display_name":"Lund University Publications (Lund University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I187531555","host_organization_name":"Lund University","host_organization_lineage":["https://openalex.org/I187531555"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferencePaper"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W166542556","https://openalex.org/W1586904125","https://openalex.org/W1976157781","https://openalex.org/W1994680554","https://openalex.org/W2011039300","https://openalex.org/W2028363565","https://openalex.org/W2066904980","https://openalex.org/W2068158377","https://openalex.org/W2084421815","https://openalex.org/W2177603603","https://openalex.org/W2296148711","https://openalex.org/W2401610261"],"related_works":["https://openalex.org/W58573123","https://openalex.org/W2634205767","https://openalex.org/W2254699604","https://openalex.org/W3147054071","https://openalex.org/W2092747350","https://openalex.org/W2144784192","https://openalex.org/W2006385089","https://openalex.org/W2361081252","https://openalex.org/W2099829246","https://openalex.org/W2046496468"],"abstract_inverted_index":{"We":[0,14],"consider":[1],"the":[2,31,34,39,43,51,58,63],"problem":[3],"of":[4,23,33,60],"finding":[5],"a":[6,16,21],"long,":[7],"simple":[8,36],"path":[9,22,37,53],"in":[10,38,62],"an":[11],"undirected":[12],"graph.":[13,40,64],"present":[15],"polynomial-time":[17],"algorithm":[18],"that":[19],"finds":[20],"length":[24,32],"$\\Omega\\bigl((\\log":[25],"L/\\log\\log":[26],"L)^2\\bigr)$,":[27],"where":[28,55],"L":[29],"denotes":[30,57],"longest":[35,52],"This":[41],"establishes":[42],"performance":[44],"ratio":[45],"O(n(log":[46],"log":[47],"n/log":[48],"n)2)":[49],"for":[50],"problem,":[54],"n":[56],"number":[59],"vertices":[61]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}