{"id":"https://openalex.org/W2014352902","doi":"https://doi.org/10.1145/1490270.1490274","title":"Directed Planar Reachability Is in Unambiguous Log-Space","display_name":"Directed Planar Reachability Is in Unambiguous Log-Space","publication_year":2009,"publication_date":"2009-02-01","ids":{"openalex":"https://openalex.org/W2014352902","doi":"https://doi.org/10.1145/1490270.1490274","mag":"2014352902"},"language":"en","primary_location":{"id":"doi:10.1145/1490270.1490274","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1490270.1490274","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/A5037531265","display_name":"Chris Bourke","orcid":null},"institutions":[{"id":"https://openalex.org/I114395901","display_name":"University of Nebraska\u2013Lincoln","ror":"https://ror.org/043mer456","country_code":"US","type":"education","lineage":["https://openalex.org/I114395901"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chris Bourke","raw_affiliation_strings":["University of Nebraska--Lincoln","#N##TAB##TAB##TAB##TAB# University of Nebraska-Lincoln#N##TAB##TAB##TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Nebraska--Lincoln","institution_ids":["https://openalex.org/I114395901"]},{"raw_affiliation_string":"#N##TAB##TAB##TAB##TAB# University of Nebraska-Lincoln#N##TAB##TAB##TAB#","institution_ids":["https://openalex.org/I114395901"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102431831","display_name":"Raghunath Tewari","orcid":"https://orcid.org/0000-0003-1522-8561"},"institutions":[{"id":"https://openalex.org/I114395901","display_name":"University of Nebraska\u2013Lincoln","ror":"https://ror.org/043mer456","country_code":"US","type":"education","lineage":["https://openalex.org/I114395901"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Raghunath Tewari","raw_affiliation_strings":["University of Nebraska--Lincoln","#N##TAB##TAB##TAB##TAB# University of Nebraska-Lincoln#N##TAB##TAB##TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Nebraska--Lincoln","institution_ids":["https://openalex.org/I114395901"]},{"raw_affiliation_string":"#N##TAB##TAB##TAB##TAB# University of Nebraska-Lincoln#N##TAB##TAB##TAB#","institution_ids":["https://openalex.org/I114395901"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031088478","display_name":"N. V. Vinodchandran","orcid":"https://orcid.org/0000-0001-7959-4662"},"institutions":[{"id":"https://openalex.org/I114395901","display_name":"University of Nebraska\u2013Lincoln","ror":"https://ror.org/043mer456","country_code":"US","type":"education","lineage":["https://openalex.org/I114395901"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"N. V. Vinodchandran","raw_affiliation_strings":["University of Nebraska--Lincoln","#N##TAB##TAB##TAB##TAB# University of Nebraska-Lincoln#N##TAB##TAB##TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Nebraska--Lincoln","institution_ids":["https://openalex.org/I114395901"]},{"raw_affiliation_string":"#N##TAB##TAB##TAB##TAB# University of Nebraska-Lincoln#N##TAB##TAB##TAB#","institution_ids":["https://openalex.org/I114395901"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.4452,"has_fulltext":false,"cited_by_count":59,"citation_normalized_percentile":{"value":0.97546366,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"1","issue":"1","first_page":"1","last_page":"17"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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/T10374","display_name":"Advanced Graph Theory Research","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/T10237","display_name":"Cryptography and Data Security","score":0.9991000294685364,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.8790621757507324},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.789638876914978},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.6502519249916077},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6488074064254761},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.6021936535835266},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5409587025642395},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5191237330436707},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5064095258712769},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.5039142966270447},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.49307534098625183},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4371494650840759},{"id":"https://openalex.org/keywords/book-embedding","display_name":"Book embedding","score":0.4353228807449341},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4108089208602905},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2725406289100647},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.21552759408950806},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.113583505153656}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8790621757507324},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.789638876914978},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.6502519249916077},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6488074064254761},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.6021936535835266},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5409587025642395},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5191237330436707},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5064095258712769},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.5039142966270447},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.49307534098625183},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4371494650840759},{"id":"https://openalex.org/C180222743","wikidata":"https://www.wikidata.org/wiki/Q4942980","display_name":"Book embedding","level":5,"score":0.4353228807449341},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4108089208602905},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2725406289100647},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.21552759408950806},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.113583505153656},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/1490270.1490274","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1490270.1490274","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.125.8061","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.125.8061","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://cse.unl.edu/~rtewari/DPRinUL.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.141.1363","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.141.1363","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://cse.unl.edu/~cbourke/pubs/DPRinUL-ToCT.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.141.169","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.141.169","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cse.unl.edu/~vinod/papers/DPRinUL.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.646.6570","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.646.6570","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://cse.unl.edu/~vinod/papers/btv_toct09.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G211748568","display_name":null,"funder_award_id":"CCF-0430991","funder_id":"https://openalex.org/F4320337387","funder_display_name":"Division of Computing and Communication Foundations"}],"funders":[{"id":"https://openalex.org/F4320309370","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10"},{"id":"https://openalex.org/F4320337387","display_name":"Division of Computing and Communication Foundations","ror":"https://ror.org/01mng8331"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W328652760","https://openalex.org/W1534848215","https://openalex.org/W1543627827","https://openalex.org/W1568726830","https://openalex.org/W1574303240","https://openalex.org/W1576388809","https://openalex.org/W1581210843","https://openalex.org/W1590224955","https://openalex.org/W1590283810","https://openalex.org/W1592405134","https://openalex.org/W1627627888","https://openalex.org/W1976781283","https://openalex.org/W1978026115","https://openalex.org/W1981234161","https://openalex.org/W1984509356","https://openalex.org/W1991188222","https://openalex.org/W1992104669","https://openalex.org/W2019136393","https://openalex.org/W2028753111","https://openalex.org/W2043360684","https://openalex.org/W2044504659","https://openalex.org/W2085634981","https://openalex.org/W2104952158","https://openalex.org/W2112149344","https://openalex.org/W2112810095","https://openalex.org/W2139236203","https://openalex.org/W2141074723","https://openalex.org/W2166162093","https://openalex.org/W2235627538","https://openalex.org/W2610479830","https://openalex.org/W2612171860","https://openalex.org/W4240781210"],"related_works":["https://openalex.org/W1491152805","https://openalex.org/W4390306783","https://openalex.org/W2995965358","https://openalex.org/W1759199114","https://openalex.org/W3002061974","https://openalex.org/W2182049810","https://openalex.org/W2009558719","https://openalex.org/W2953040170","https://openalex.org/W3216500139","https://openalex.org/W2784912776"],"abstract_inverted_index":{"We":[0,55,71],"make":[1],"progress":[2],"in":[3,12,48],"understanding":[4],"the":[5,8,13,36,49,57,61,66,78,90],"complexity":[6],"of":[7,15,23,59,99],"graph":[9,68],"reachability":[10,39,69,79],"problem":[11,40,80],"context":[14],"unambiguous":[16,51],"logarithmic":[17,52,93],"space":[18,53,94],"computation;":[19],"a":[20,31,73],"restricted":[21],"form":[22],"nondeterminism.":[24],"As":[25],"our":[26,100],"main":[27],"result,":[28],"we":[29],"show":[30],"new":[32],"upper":[33,63],"bound":[34,64],"on":[35],"directed":[37,82,103],"planar":[38],"by":[41],"showing":[42,60,76],"that":[43,77],"it":[44],"can":[45],"be":[46],"decided":[47],"class":[50,91],"(UL).":[54],"explore":[56],"possibility":[58],"same":[62],"for":[65,81,89],"general":[67],"problem.":[70],"give":[72],"simple":[74],"reduction":[75],"graphs":[83,104],"with":[84,105],"thickness":[85,106],"two":[86,107],"is":[87],"complete":[88],"nondeterministic":[92],"(NL).":[95],"Hence":[96],"an":[97],"extension":[98],"results":[101],"to":[102,112],"will":[108],"unconditionally":[109],"collapse":[110],"NL":[111],"UL.":[113]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":6}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}