{"id":"https://openalex.org/W946369786","doi":"https://doi.org/10.1007/978-3-642-35261-4_42","title":"A Strongly Polynomial Time Algorithm for the Shortest Path Problem on Coherent Planar Periodic Graphs","display_name":"A Strongly Polynomial Time Algorithm for the Shortest Path Problem on Coherent Planar Periodic Graphs","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W946369786","doi":"https://doi.org/10.1007/978-3-642-35261-4_42","mag":"946369786"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-35261-4_42","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-35261-4_42","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/A5025007214","display_name":"Norie Fu","orcid":null},"institutions":[{"id":"https://openalex.org/I161296585","display_name":"Tokyo University of Science","ror":"https://ror.org/05sj3n476","country_code":"JP","type":"education","lineage":["https://openalex.org/I161296585"]},{"id":"https://openalex.org/I74801974","display_name":"The University of Tokyo","ror":"https://ror.org/057zh3y96","country_code":"JP","type":"education","lineage":["https://openalex.org/I74801974"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Norie Fu","raw_affiliation_strings":["Department of Computer Science, University of Tokyo, Japan","university of Tokyo;"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Tokyo, Japan","institution_ids":["https://openalex.org/I161296585","https://openalex.org/I74801974"]},{"raw_affiliation_string":"university of Tokyo;","institution_ids":["https://openalex.org/I74801974"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5025007214"],"corresponding_institution_ids":["https://openalex.org/I161296585","https://openalex.org/I74801974"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":3.0958,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.90398126,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"392","last_page":"401"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11476","display_name":"Graph theory and applications","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11476","display_name":"Graph theory and applications","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9957000017166138,"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/longest-path-problem","display_name":"Longest path problem","score":0.6568850874900818},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6085456609725952},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.604193925857544},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5711572766304016},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5630422234535217},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5065137147903442},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4887997806072235},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.46087104082107544},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3351908326148987},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28306031227111816},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.24085286259651184},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.22699174284934998},{"id":"https://openalex.org/keywords/computer-graphics","display_name":"Computer graphics (images)","score":0.06598937511444092}],"concepts":[{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.6568850874900818},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6085456609725952},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.604193925857544},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5711572766304016},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5630422234535217},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5065137147903442},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4887997806072235},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.46087104082107544},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3351908326148987},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28306031227111816},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.24085286259651184},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.22699174284934998},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.06598937511444092},{"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-642-35261-4_42","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-35261-4_42","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":20,"referenced_works":["https://openalex.org/W1499381650","https://openalex.org/W1963547452","https://openalex.org/W1975778932","https://openalex.org/W1988262898","https://openalex.org/W1994733652","https://openalex.org/W2002252837","https://openalex.org/W2040101882","https://openalex.org/W2054279301","https://openalex.org/W2087107562","https://openalex.org/W2088459020","https://openalex.org/W2103985627","https://openalex.org/W2142132729","https://openalex.org/W2158907148","https://openalex.org/W2169431615","https://openalex.org/W2333948988","https://openalex.org/W2408253508","https://openalex.org/W2530920077","https://openalex.org/W4206077821","https://openalex.org/W4229758208","https://openalex.org/W4253221855"],"related_works":["https://openalex.org/W3216105633","https://openalex.org/W2019085620","https://openalex.org/W2990956612","https://openalex.org/W2776102956","https://openalex.org/W4382866750","https://openalex.org/W2584131233","https://openalex.org/W4293167680","https://openalex.org/W4387185483","https://openalex.org/W616034966","https://openalex.org/W2018146256"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2017,"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":1}],"updated_date":"2026-08-04T08:18:43.703281","created_date":"2025-10-10T00:00:00"}