• DocumentCode
    2956013
  • Title

    Directed Planar Reachability is in Unambiguous Log-Space

  • Author

    Bourke, Chris ; Tewari, Raghunath ; Vinodchandran, N.V.

  • Author_Institution
    Univ. of Nebraska, Lincoln
  • fYear
    2007
  • fDate
    13-16 June 2007
  • Firstpage
    217
  • Lastpage
    221
  • Abstract
    We show that the st-connectivity problem for directed planar graphs can be decided in unambiguous logarithmic space.
  • Keywords
    directed graphs; reachability analysis; directed planar reachability; st-connectivity problem; unambiguous logarithmic space; Circuits; Complexity theory; Computational complexity; Computer science; Joining processes; Upper bound;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computational Complexity, 2007. CCC '07. Twenty-Second Annual IEEE Conference on
  • Conference_Location
    San Diego, CA
  • ISSN
    1093-0159
  • Print_ISBN
    0-7695-2780-9
  • Type

    conf

  • DOI
    10.1109/CCC.2007.9
  • Filename
    4262765
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2956013