3-connected Planar Graph Isomorphism is in Log-space
Computational Complexity
2008-09-16 v1
Abstract
We show that the isomorphism of 3-connected planar graphs can be decided in deterministic log-space. This improves the previously known bound ULcoUL of Thierauf and Wagner.
Cite
@article{arxiv.0806.1041,
title = {3-connected Planar Graph Isomorphism is in Log-space},
author = {Samir Datta and Nutan Limaye and Prajakta Nimbhorkar},
journal= {arXiv preprint arXiv:0806.1041},
year = {2008}
}