{"id":"https://openalex.org/W2099829246","doi":"https://doi.org/10.1007/3-540-45465-9_84","title":"Finding a Path of Superlogarithmic Length","display_name":"Finding a Path of Superlogarithmic Length","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W2099829246","doi":"https://doi.org/10.1007/3-540-45465-9_84","mag":"2099829246"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-45465-9_84","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45465-9_84","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":"conference-paper","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/A5047762447","display_name":"Anders Bj\u00f6rklund","orcid":"https://orcid.org/0000-0002-5676-6203"},"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":"A. Bj\u00f6rklund","raw_affiliation_strings":["Department of Computer Science, Lund University, Box 118, 221 00, Lund, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Lund University, Box 118, 221 00, 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":true,"raw_author_name":"T. Husfeldt","raw_affiliation_strings":["Department of Computer Science, Lund University, Box 118, 221 00, Lund, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Lund University, Box 118, 221 00, Lund, Sweden","institution_ids":["https://openalex.org/I187531555"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5041727204"],"corresponding_institution_ids":["https://openalex.org/I187531555"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.12414837,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"985","last_page":"992"},"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.9991999864578247,"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.9976000189781189,"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.6874291896820068},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6654075384140015},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6178601384162903},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5844932794570923},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5682297945022583},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.5311602354049683},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.5275399684906006},{"id":"https://openalex.org/keywords/path-graph","display_name":"Path graph","score":0.5206417441368103},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.516690731048584},{"id":"https://openalex.org/keywords/path-length","display_name":"Path length","score":0.4678790271282196},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4484163522720337},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4371318817138672},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3998130261898041},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34169405698776245},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.305963397026062},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.14065971970558167},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.12531167268753052}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6874291896820068},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6654075384140015},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6178601384162903},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5844932794570923},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5682297945022583},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.5311602354049683},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.5275399684906006},{"id":"https://openalex.org/C128067373","wikidata":"https://www.wikidata.org/wiki/Q1415372","display_name":"Path graph","level":5,"score":0.5206417441368103},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.516690731048584},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.4678790271282196},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4484163522720337},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4371318817138672},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3998130261898041},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34169405698776245},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.305963397026062},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.14065971970558167},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.12531167268753052},{"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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/3-540-45465-9_84","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45465-9_84","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["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","https://openalex.org/W4241764762","https://openalex.org/W6635196688"],"related_works":["https://openalex.org/W2129550502","https://openalex.org/W4377232111","https://openalex.org/W1957820195","https://openalex.org/W2776102956","https://openalex.org/W113232329","https://openalex.org/W1995738188","https://openalex.org/W4304192587","https://openalex.org/W4289704160","https://openalex.org/W3121940326","https://openalex.org/W2099829246"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}