3-connected Planar Graph Isomorphism is in Log-space
classification
💻 cs.CC
keywords
connectedisomorphismlog-spaceplanarboundcouldecideddeterministic
read the original abstract
We show that the isomorphism of 3-connected planar graphs can be decided in deterministic log-space. This improves the previously known bound UL$\cap$coUL of Thierauf and Wagner.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.