平面3-连通图的同构问题是在非双对数空间中
The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace
摘要：
平面图的同构问题是一个有效的可解问题。对于平面3-连通图，同构问题可以用有效的并行算法来解决，它属于$AC^1$类。本文将平面3-连通图的上界推广到无二义性的对数空间，实际上推广到$UL \cap coUL$。作为我们的方法的结果，我们得到了有向图的同构问题是在$NL$。我们还表明，问题是困难的$L$。
英文摘要：
The isomorphism problem for planar graphs is known to be efficiently solvable. For planar 3-connected graphs, the isomorphism problem can be solved by efficient parallel algorithms, it is in the class $AC^1$. In this paper we improve the upper bound for planar 3-connected graphs to unambiguous logspace, in fact to $UL \cap coUL$. As a consequence of our method we get that the isomorphism problem for oriented graphs is in $NL$. We also show that the problems are hard for $L$.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
