{"id":"https://openalex.org/W1537214435","doi":"https://doi.org/10.1007/978-3-540-77050-3_18","title":"Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs","display_name":"Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs","publication_year":2007,"publication_date":"2007-01-01","ids":{"openalex":"https://openalex.org/W1537214435","doi":"https://doi.org/10.1007/978-3-540-77050-3_18","mag":"1537214435"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-77050-3_18","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-77050-3_18","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/A5053904278","display_name":"Andreas Jakoby","orcid":null},"institutions":[{"id":"https://openalex.org/I9341345","display_name":"University of L\u00fcbeck","ror":"https://ror.org/00t3r8h32","country_code":"DE","type":"education","lineage":["https://openalex.org/I9341345"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Andreas Jakoby","raw_affiliation_strings":["Inst. f\u00fcr Theoretische Informatik, Universit\u00e4t zu L\u00fcbeck, Germany","Inst. f\u00fcr Theoretische Informatik, Universit\u00e4t zu L\u00fcbeck, Germany#TAB#"],"affiliations":[{"raw_affiliation_string":"Inst. f\u00fcr Theoretische Informatik, Universit\u00e4t zu L\u00fcbeck, Germany","institution_ids":["https://openalex.org/I9341345"]},{"raw_affiliation_string":"Inst. f\u00fcr Theoretische Informatik, Universit\u00e4t zu L\u00fcbeck, Germany#TAB#","institution_ids":["https://openalex.org/I9341345"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003607737","display_name":"Till Tantau","orcid":"https://orcid.org/0000-0002-3946-8028"},"institutions":[{"id":"https://openalex.org/I9341345","display_name":"University of L\u00fcbeck","ror":"https://ror.org/00t3r8h32","country_code":"DE","type":"education","lineage":["https://openalex.org/I9341345"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Till Tantau","raw_affiliation_strings":["Inst. f\u00fcr Theoretische Informatik, Universit\u00e4t zu L\u00fcbeck, Germany","Inst. f\u00fcr Theoretische Informatik, Universit\u00e4t zu L\u00fcbeck, Germany#TAB#"],"affiliations":[{"raw_affiliation_string":"Inst. f\u00fcr Theoretische Informatik, Universit\u00e4t zu L\u00fcbeck, Germany","institution_ids":["https://openalex.org/I9341345"]},{"raw_affiliation_string":"Inst. f\u00fcr Theoretische Informatik, Universit\u00e4t zu L\u00fcbeck, Germany#TAB#","institution_ids":["https://openalex.org/I9341345"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5053904278"],"corresponding_institution_ids":["https://openalex.org/I9341345"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.7286,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.90291852,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"216","last_page":"227"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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.9998000264167786,"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.9994000196456909,"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.9940999746322632,"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/pathwidth","display_name":"Pathwidth","score":0.6894965171813965},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.677647590637207},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.6658815145492554},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.6623237729072571},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6513340473175049},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.6399551630020142},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48130834102630615},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.4792380630970001},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4749351143836975},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4437696635723114},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40858161449432373},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.33812451362609863},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.16879978775978088},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.09863308072090149}],"concepts":[{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.6894965171813965},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.677647590637207},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.6658815145492554},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.6623237729072571},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6513340473175049},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.6399551630020142},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48130834102630615},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.4792380630970001},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4749351143836975},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4437696635723114},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40858161449432373},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.33812451362609863},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.16879978775978088},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.09863308072090149}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-540-77050-3_18","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-77050-3_18","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":26,"referenced_works":["https://openalex.org/W183837203","https://openalex.org/W1498403965","https://openalex.org/W1504895562","https://openalex.org/W1551316870","https://openalex.org/W1593059705","https://openalex.org/W1836127928","https://openalex.org/W1971056052","https://openalex.org/W1978825460","https://openalex.org/W1983784492","https://openalex.org/W1985495277","https://openalex.org/W1993522985","https://openalex.org/W2010600799","https://openalex.org/W2014352902","https://openalex.org/W2015676876","https://openalex.org/W2017492235","https://openalex.org/W2030429378","https://openalex.org/W2048362350","https://openalex.org/W2054260295","https://openalex.org/W2068638452","https://openalex.org/W2071260871","https://openalex.org/W2071362870","https://openalex.org/W2073840571","https://openalex.org/W2112810095","https://openalex.org/W2125463200","https://openalex.org/W2133684487","https://openalex.org/W2166162093"],"related_works":["https://openalex.org/W2029854525","https://openalex.org/W4283803822","https://openalex.org/W3094955858","https://openalex.org/W4226049246","https://openalex.org/W2016277208","https://openalex.org/W110470963","https://openalex.org/W2362011785","https://openalex.org/W1587794359","https://openalex.org/W2031276298","https://openalex.org/W3130332934"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}