Longest paths in Planar DAGs in Unambiguous Logspace
Computational Complexity
2008-02-13 v1
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.
Cite
@article{arxiv.0802.1699,
title = {Longest paths in Planar DAGs in Unambiguous Logspace},
author = {Nutan Limaye and Meena Mahajan and Prajakta Nimbhorkar},
journal= {arXiv preprint arXiv:0802.1699},
year = {2008}
}