A logspace algorithm for partial 2-tree canonization

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5010 LNCS, Issue , 2008, Pages 40-51

  Arvind, Vikraman ^a   Das, Bireswar ^a   Köbler, Johannes ^b  

^a INSTITUTE OF MATHEMATICAL SCIENCES   (India)

^b HUMBOLDT UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; THEOREM PROVING; TREES (MATHEMATICS);

LOGSPACE ALGORITHM; PARTIAL 2-TREE CANONIZATION;

PROBLEM SOLVING;

EID: 44649134006     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-79709-8_8     Document Type: Conference Paper

References (20)

1. Arvind, V., Das, B., Köbler, J.: The space complexity of k-tree isomorphism. In: Proc. 18th International Symposium on Algorithms and Computation. LNCS, pp. 822-833. Springer, Heidelberg (2007)
2. Allender, E.: Arithmetic circuits and counting complexity classes. In: Krajíček, J. (ed.) Complexity of Computations and Proofs. Seconda Universita di Napoli. Quaderni di Matematica, vol. 13, pp. 33-72 (2004)
3. Allender, E., Ogihara, M.: Relationships among PL, #L and the determinant. R.A.I.R.O. Informatique Théorique et Applications 30(1), 1-21 (1996)
4. Arnborg, S., Proskurowski, A.: Linear time algorithms for NP-hard problems restricted to partial k-trees. Discrete Applied Mathematics 23(2), 11-24 (1989)
5. Arnborg, S., Proskurowski, A.: Canonical representations of partial 2- and 3-trees. BIT 32(2), 197-214 (1992)
6. Babai, L., Erdös, P., Selkow, S.M.: Random graph isomorphism. SIAM Journal on Computing 9(3), 628-635 (1980)
7. Babai, L., Kučera, L.: Canonical labelling of graphs in linear average time. In: Proc. 20th IEEE Symposium on the Foundations of Computer Science, pp. 39-46 (1979)
8. Babai, L., Luks, E.: Canonical labeling of graphs. In: Proc. 15th ACM Symposium on Theory of Computing, pp. 171-183 (1983)
9. Gurevich, Y.: From invariants to canonization. Bulletin of the European Association of Theoretical Computer Science (BEATCS) 63, 115-119 (1997)
10. Grohe, M., Verbitsky, O.: Testing graph isomorphism in parallel by playing a game. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 3-14. Springer, Heidelberg (2006)
11. Hoffmann, C.M.: Group-Theoretic Algorithms and Graph Isomorphism. LNCS, vol. 136. Springer, Heidelberg (1982)
12. Harary, F., Palmer, E.M.: On acyclic simplicial complexes. Mathematica 15, 115-122 (1968)
13. Jakoby, A., Liskiewicz, M.: Paths Problems in Symmetric Logarithmic Space. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 269-280. Springer, Heidelberg (2002)
14. Jenner, B., Köbler, J., McKenzie, P., Torán, J.: Completeness results for graph isomorphism. Journal of Computer and System Sciences 66, 549-566 (2003)
15. Kloks, T.: Treewidth: Computation and Approximation. LNCS, vol. 842. Springer, Heidelberg (1994)
16. Köbler, J., Schöning, U., Torán, J.: The Graph Isomorphism Problem: Its Structural Complexity. In: Progress in Theoretical Computer Science. Birkhäuser, Boston (1993)
17. Lindell, S.: A logspace algorithm for tree canonization. In: Proc. 24th ACM Symposium on Theory of Computing, pp. 400-404. ACM Press, New York (1992)
18. Luks, E.M.: Permutation groups and polynomial time computations. In: Finkelstein, L., Kantor, W.M. (eds.) Groups and Computation. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 11, pp. 139-175. American Mathematical Society (1993)
19. Reingold, O.: Undirected ST-connectivity in log-space. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, pp. 376-385 (2005)
20. Thierauf, T., Wagner, F.: The isomorphism problem for planar 3-connected graphs is in unambiguous logspace. Technical Report TR07-068, Electronic Colloquium on Computational Complexity (ECCC) (2007)