License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2008.1327
URN: urn:nbn:de:0030-drops-13273
URL: http://drops.dagstuhl.de/opus/volltexte/2008/1327/
Go to the corresponding Portal


Thierauf, Thomas ; Wagner, Fabian

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

pdf-format:
Document 1.pdf (168 KB)


Abstract

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$.

BibTeX - Entry

@InProceedings{thierauf_et_al:LIPIcs:2008:1327,
  author =	{Thomas Thierauf and Fabian Wagner},
  title =	{{The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace}},
  booktitle =	{25th International Symposium on Theoretical Aspects of Computer Science},
  pages =	{633--644},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-06-4},
  ISSN =	{1868-8969},
  year =	{2008},
  volume =	{1},
  editor =	{Susanne Albers and Pascal Weil},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2008/1327},
  URN =		{urn:nbn:de:0030-drops-13273},
  doi =		{http://dx.doi.org/10.4230/LIPIcs.STACS.2008.1327},
  annote =	{Keywords: }
}

Seminar: 25th International Symposium on Theoretical Aspects of Computer Science
Issue Date: 2008
Date of publication: 06.02.2008


DROPS-Home | Fulltext Search | Imprint Published by LZI