加载中…
2008-02-12
Longest paths in Planar DAGs in Unambiguous Logspace
Nutan LimayeMeena MahajanPrajakta Nimbhorkar
文献摘要
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.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本