The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace

Simple item page
dc.creatorThierauf, Thomas
dc.creatorWagner, Fabian
dc.date2008-02-20
dc.date.accessioned2026-07-07T09:21:58Z
dc.date.available2026-07-07T09:21:58Z
dc.descriptionThe 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$.
dc.identifierhttps://arxiv.org/abs/0802.2825
dc.identifierhttp://arxiv.org/abs/0802.2825
dc.identifierDans Proceedings of the 25th Annual Symposium on the Theoretical Aspects of Computer Science - STACS 2008, Bordeaux : France (2008)
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/155218
dc.subjectData Structures and Algorithms
dc.subjectComputational Complexity
dc.titleThe Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace
dc.typetext

Files

Collections

arXiv