Planar graph isomorphism is in log-space

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2009, Pages 203-214

  Datta, Samir ^d   Limaye, Nutan ^a   Nimbhorkar, Prajakta ^a   Thierauf, Thomas ^b   Wagner, Fabian ^c  

^a INSTITUTE OF MATHEMATICAL SCIENCES   (India)

^b Fakultät für Elektronik und Informatik   (Germany)

^c UNIVERSITY OF ULM   (Germany)

^d CHENNAI MATHEMATICAL INSTITUTE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; FORESTRY; GRAPHIC METHODS; GROUP THEORY;

3-CONNECTED PLANAR GRAPHS; AUTOMORPHISMS; BICONNECTED COMPONENTS; COMPONENT TREE; COMPUTATIONAL PROBLEM; GRAPH ISOMORPHISM; LOWER AND UPPER BOUNDS; SPACE COMPLEXITY;

TREES (MATHEMATICS);

EID: 70350646989     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ccc.2009.16     Document Type: Conference Paper

References (34)

1. [AD04] V. Arvind and Nikhil Devanur. Symmetry breaking in trees and planar graphs by vertex coloring. In The Nordic Combinatorial Conference (NORCOM), 2004.
2. [ADK08] V. Arvind, Bireswar Das, and Johannes Köbler. A logspace algorithm for partial 2-tree canonization. In Computer Science Symposium in Russia (CSR), pages 40-51, 2008.
3. [ADR05] Eric Allender, Samir Datta, and Sambuddha Roy. The directed planar reachability problem. In Proceedings of the 25th annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), pages 238-249, 2005.
4. [AK06] V. Arvind and Piyush P. Kurur. Graph isomorphism is in spp. Information and Computation, 204(5): 835-852, 2006.
5. [AM00] Eric Allender and Meena Mahajan. The complexity of planarity testing. In Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science (STACS), pages 87-98, 2000.
6. [Art96] Michael Artin. Algebra. Prentice Hall, 1996.
7. [Bab95] László Babai. Automorphism groups, isomorphism, reconstruction. Handbook of combinatorics, 2: 1447- 1540, 1995.
8. [BHZ87] Ravi B. Boppana, Johan Hastad, and Stathis Zachos. Does co-NP have short interactive proofs? Information Processing Letters, 25(2): 127-132, 1987.
9. [BL83] László Babai and Eugene M. Luks. Canonical labeling of graphs. In Proceedings of the fifteenth annual ACM Symposium on Theory of Computing (STOC), pages 171-183, 1983.
10. [BTV07] Chris Bourke, Raghunath Tewari, and N.V. Vinodchandran. Directed planar reachability is in unambiguous log-space. In IEEE Conference on Computational Complexity (CCC), pages 217-221, 2007.
11. [Bus97] Samuel R. Buss. Alogtime algorithms for tree isomorphism, comparison, and canonization. In Proceedings of the 5th Kurt Gödel Colloquium on Computational Logic and Proof Theory, pages 18-33, 1997.
12. [Coo85] Stephen A. Cook. A taxonomy of problems with fast parallel algorithms. Information and Control, 64(1- 3): 2-22, 1985.
13. [DLN08] Samir Datta, Nutan Limaye, and Prajakta Nimbhorkar. 3-connected planar graph isomorphism is in log-space. In Proceedings of the 28th annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), pages 153-162, 2008.
14. [HT73] John E. Hopcroft and Robert E. Tarjan. Dividing a graph into triconnected components. SIAM Journal on Computing, 2(3): 135-158, 1973.
15. [HT74] John E. Hopcroft and Robert Tarjan. Efficient planarity testing. Journal of the ACM, 21(4): 549-568, 1974.
16. [HW74] John E. Hopcroft and J.K. Wong. Linear time algorithm for isomorphism of planar graphs (preliminary report). In Proceedings of the 6th annual ACM Symposium on Theory of Computing (STOC), pages 172-184, 1974.
17. [JKMT03] Birgit Jenner, Johannes K̈obler, Pierre McKenzie, and Jacobo Toŕan. Completeness results for graph isomorphism. Journal of Computing and System Sciences, 66(3): 549-566, 2003.
18. [KHC04] Jacek P. Kukluk, Lawrence B. Holder, and Diane J. Cook. Algorithm and experiments in testing planar graphs for isomorphism. Journal of Graph Algorithms and Applications, 8(2): 313-356, 2004.
19. [KST93] Johannes K̈obler, Uwe Scḧoning, and Jacobo Torán. The Graph Isomorphism Problem. Birkhäuser, 1993.
20. [Lin92] Steven Lindell. A logspace algorithm for tree canonization (extended abstract). In Proceedings of the 24th annual ACM Symposium on Theory of Computing (STOC), pages 400-404, 1992.
21. [Mac37] Saunders Maclane. A structural characterization of planar combinatorial graphs. Duke Mathematical Journal, 3: 460-472, 1937.
22. [MJT98] Pierre McKenzie, Birgit Jenner, and Jacobo Toŕan. A note on the hardness of tree isomorphism. In Proceedings of the 13th Annual IEEE Conference on Computational Complexity (CCC). IEEE Computer Society, 1998.
23. [MR91] Gary L. Miller and John H. Reif. Parallel tree contraction part 2: further applications. SIAM Journal on Computing, 20(6): 1128-1147, 1991.
24. [RA97] Klaus Reinhardt and Eric Allender. Making nondeterminism unambiguous. In IEEE Symposium on Foundations of Computer Science, pages 244-253, 1997.
25. [Rei05] Omer Reingold. Undirected st-connectivity in logspace. In Proceedings of the 37th annual ACM Symposium on Theory of Computing (STOC), pages 376-385, 2005.
26. [RR94] Vijaya Ramachandran and John H. Reif. Planarity testing in parallel. Journal of Computer and System Sciences, 49: 517-561, 1994.
27. [Sch88] Uwe Scḧoning. Graph isomorphism is in the low hierarchy. Journal on Computing and System Sciences, 37(3): 312-323, 1988.
28. [Tor04] Jacobo Toŕan. On the hardness of graph isomorphism. SIAM Journal on Computing, 33(5): 1093-1108, 2004.
29. [TW08] Thomas Thierauf and Fabian Wagner. The isomorphism problem for planar 3-connected graphs is in unambiguous logspace. In 25th International Symposium on Theoretical Aspects of Computer Science (STACS), pages 633-644, 2008.
30. [TW09] Thomas Thierauf and Fabian Wagner. Reachability in k3, 3-free graphs and k5-free graphs is in unambiguous log-space. Technical Report TR09-029, Electronic Colloquium on Computational Complexity (ECCC), 2009.
31. [Ver07] Oleg Verbitsky. Planar graphs: Logical complexity and parallel isomorphism tests. In 24th International Symposium on Theoretical Aspects of Computer Science (STACS), pages 682-693, 2007.
32. [Wag07] Fabian Wagner. Hardness results for tournament isomorphism and automorphism. In 32nd International Symposium on Mathematical Foundations of Computer Science (MFCS), pages 572-583, 2007.
33. [Wei66] Louis Weinberg. A simple and efficient algorithm for determining isomorphism of planar triply connected graphs. Circuit Theory, 13: 142-148, 1966.
34. [Whi33] Hassler Whitney. A set of topological invariants for graphs. American Journal of Mathematics, 55: 235- 321, 1933.