{"id":"https://openalex.org/W2065826192","doi":"https://doi.org/10.1137/s0097539797330343","title":"Finding an Even Simple Path in a Directed Planar Graph","display_name":"Finding an Even Simple Path in a Directed Planar Graph","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W2065826192","doi":"https://doi.org/10.1137/s0097539797330343","mag":"2065826192"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539797330343","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539797330343","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5003696543","display_name":"Zhivko Nedev","orcid":"https://orcid.org/0000-0003-0065-9895"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Zhivko Prodanov Nedev","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5003696543"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.19363725,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"29","issue":"2","first_page":"685","last_page":"695"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9986000061035156,"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.9986000061035156,"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.9979000091552734,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9954000115394592,"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/combinatorics","display_name":"Combinatorics","score":0.7221276164054871},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.662160336971283},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6451568007469177},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.6341953873634338},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.6114904880523682},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.603113055229187},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5682068467140198},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.5541443824768066},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44665640592575073},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43394845724105835},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42465871572494507},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2905429005622864},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.2748907208442688}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7221276164054871},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.662160336971283},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6451568007469177},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.6341953873634338},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.6114904880523682},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.603113055229187},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5682068467140198},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.5541443824768066},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44665640592575073},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43394845724105835},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42465871572494507},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2905429005622864},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.2748907208442688},{"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},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539797330343","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539797330343","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1655990431","https://openalex.org/W2007804392","https://openalex.org/W2011039300","https://openalex.org/W2039972044","https://openalex.org/W2050579693","https://openalex.org/W2118382442","https://openalex.org/W2135282325","https://openalex.org/W2569646339"],"related_works":["https://openalex.org/W3216105633","https://openalex.org/W2019085620","https://openalex.org/W2990956612","https://openalex.org/W2584131233","https://openalex.org/W2040444410","https://openalex.org/W1539367839","https://openalex.org/W2963756941","https://openalex.org/W4377232111","https://openalex.org/W4226143152","https://openalex.org/W2539729130"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3],"show":[4],"that":[5],"the":[6,9,58,61],"following":[7],"problem,":[8],"even":[10,53],"simple":[11,42],"path":[12,43,59],"(ESP)":[13],"problem":[14],"for":[15],"directed":[16,26],"planar":[17,27],"graphs,":[18],"is":[19,60],"solvable":[20],"in":[21],"polynomial":[22],"time:":[23],"Given:":[24],"a":[25,41],"graph":[28],"G=(V,E)":[29],"and":[30],"two":[31],"nodes":[32],"s,":[33],"(starting":[34],"node),":[35],"t":[36,51],",(targetnode)":[37],"\\in":[38],"V;":[39],"Find:":[40],"(i.e.,":[44],"without":[45],"repeated":[46],"nodes)":[47],"from":[48],"s":[49],"to":[50],"of":[52,57,63],"length.":[54],"(The":[55],"length":[56],"number":[62],"edges":[64],"it":[65],"contains.)":[66]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}