无约束对数空间中平面DAG的最长路径
Longest paths in Planar DAGs in Unambiguous Logspace
摘要：
我们通过两种不同的算法，发现在平面有向无环图（DAG）的最长路径的长度是在明确的对数空间UL，也在补类co-UL。结果也扩展到环形DAG。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
