{"id":"https://openalex.org/W1486144962","doi":"https://doi.org/10.1145/3154857","title":"An <i>O</i> ( <i>n</i> <sup>\u03f5</sup> ) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs","display_name":"An <i>O</i> ( <i>n</i> <sup>\u03f5</sup> ) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs","publication_year":2017,"publication_date":"2017-12-05","ids":{"openalex":"https://openalex.org/W1486144962","doi":"https://doi.org/10.1145/3154857","mag":"1486144962"},"language":"en","primary_location":{"id":"doi:10.1145/3154857","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3154857","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","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/A5024602075","display_name":"Diptarka Chakraborty","orcid":"https://orcid.org/0000-0002-0687-5823"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Diptarka Chakraborty","raw_affiliation_strings":["Computer Science Institute of Charles University, Czech Republic","Computer Science Institute of Charles University, Czech Republic#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Institute of Charles University, Czech Republic","institution_ids":["https://openalex.org/I21250087"]},{"raw_affiliation_string":"Computer Science Institute of Charles University, Czech Republic#TAB#","institution_ids":["https://openalex.org/I21250087"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102431831","display_name":"Raghunath Tewari","orcid":"https://orcid.org/0000-0003-1522-8561"},"institutions":[{"id":"https://openalex.org/I94234084","display_name":"Indian Institute of Technology Kanpur","ror":"https://ror.org/05pjsgx75","country_code":"IN","type":"education","lineage":["https://openalex.org/I94234084"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Raghunath Tewari","raw_affiliation_strings":["Indian Institute of Technology Kanpur, Kanpur, Uttar Pradesh, India","Indian Institute of Technology Kanpur, Kanpur, Uttar Pradesh, India,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology Kanpur, Kanpur, Uttar Pradesh, India","institution_ids":["https://openalex.org/I94234084"]},{"raw_affiliation_string":"Indian Institute of Technology Kanpur, Kanpur, Uttar Pradesh, India,","institution_ids":["https://openalex.org/I94234084"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7178,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.70720175,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"9","issue":"4","first_page":"1","last_page":"11"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9983000159263611,"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/T12288","display_name":"Optimization and Search Problems","score":0.9966999888420105,"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/reachability","display_name":"Reachability","score":0.9065603017807007},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.742950975894928},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6645547747612},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5807278156280518},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.5626013278961182},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5562969446182251},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5230984687805176},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.5124183297157288},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4910249710083008},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.48273274302482605},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.3465402126312256},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19816583395004272}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.9065603017807007},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.742950975894928},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6645547747612},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5807278156280518},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.5626013278961182},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5562969446182251},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5230984687805176},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.5124183297157288},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4910249710083008},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.48273274302482605},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3465402126312256},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19816583395004272}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3154857","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3154857","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","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":32,"referenced_works":["https://openalex.org/W192770227","https://openalex.org/W206903853","https://openalex.org/W1513809451","https://openalex.org/W1527197079","https://openalex.org/W1534848215","https://openalex.org/W1543627827","https://openalex.org/W1566033350","https://openalex.org/W1597166809","https://openalex.org/W1956773383","https://openalex.org/W1966020295","https://openalex.org/W1982129592","https://openalex.org/W1991787408","https://openalex.org/W1992104669","https://openalex.org/W1998473998","https://openalex.org/W1998698985","https://openalex.org/W2014352902","https://openalex.org/W2039302045","https://openalex.org/W2049516232","https://openalex.org/W2055100233","https://openalex.org/W2072560800","https://openalex.org/W2081926325","https://openalex.org/W2131115830","https://openalex.org/W2159595426","https://openalex.org/W2261777468","https://openalex.org/W2293097972","https://openalex.org/W2337498233","https://openalex.org/W2399577022","https://openalex.org/W2408743861","https://openalex.org/W2580567258","https://openalex.org/W2776523355","https://openalex.org/W3034161672","https://openalex.org/W4210896998"],"related_works":["https://openalex.org/W2047831585","https://openalex.org/W4253760428","https://openalex.org/W3208672221","https://openalex.org/W3017277461","https://openalex.org/W2099490078","https://openalex.org/W4287199681","https://openalex.org/W3172202899","https://openalex.org/W1548979236","https://openalex.org/W4224983736","https://openalex.org/W1970063378"],"abstract_inverted_index":{"Given":[0],"a":[1,22],"graph":[2,12,81],"G":[3,29],"and":[4,8,46,95],"two":[5],"vertices":[6],"s":[7,25],"t":[9,27],"in":[10,28,35,43,83,92,96],"it,":[11],"reachability":[13,34,82],"is":[14,87],"the":[15],"problem":[16,65],"of":[17],"checking":[18],"whether":[19],"there":[20],"exists":[21],"path":[23],"from":[24],"to":[26],".":[30],"We":[31],"show":[32],"that":[33],"directed":[36],"layered":[37],"planar":[38],"graphs":[39],"can":[40],"be":[41],"decided":[42],"polynomial":[44,67],"time":[45,68],"O":[47,71],"(":[48],"n":[49,73],"\u03f5":[50,55],")":[51,74],"space,":[52],"for":[53,63],"any":[54],"&gt;":[56],"0.":[57],"The":[58],"previous":[59],"best-known":[60],"space":[61,75],"bound":[62],"this":[64,97,104],"with":[66],"was":[69],"approximately":[70],"(\u221a":[72],"(Imai":[76],"et":[77],"al.":[78],"2013).":[79],"Deciding":[80],"SC":[84],"(Steve's":[85],"class)":[86],"an":[88],"important":[89],"open":[90],"question":[91],"complexity":[93],"theory,":[94],"article,":[98],"we":[99],"make":[100],"progress":[101],"toward":[102],"resolving":[103],"question.":[105]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2016,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}