Longest paths in Planar DAGs in Unambiguous Logspace
classification
💻 cs.CC
keywords
dagslogspacelongestplanarunambiguousacyclicalgorithmsclass
read the original abstract
We show via two different algorithms that finding the length of the longest path in planar directed acyclic graph (DAG) is in unambiguous logspace UL, and also in the complement class co-UL. The result extends to toroidal DAGs as well.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.