The space complexity of k-tree isomorphism

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

Volumn 4835 LNCS, Issue , 2007, Pages 822-833

  Arvind, V ^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 COMPLEXITY;

K-TREES; LOGSPACE ALGORITHMS; SPACE COMPLEXITY;

TREES (MATHEMATICS);

EID: 38149022547     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77120-3_71     Document Type: Conference Paper

References (27)

1. 2 n/loglog n). Theory of Computing Systems 31, 539-550 (1989)
2. Allender, E.: Arithmetic circuits and counting complexity classes. In: Krajič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. Babai, L.: A Las Vegas-NC algorithm for isomorphism of graphs with bounded multiplicity of eigenvalues. In: Proc. 27th IEEE Symposium on the Foundations of Computer Science, pp. 303-312. IEEE Computer Society Press, Los Alamitos (1986)
6. Buntrock, G., Jenner, B., Lange, K.-J., Rossmanith, P.: Unambiguity and fewness for logarithmic space. In: Budach, L. (ed.) FCT 1991. LNCS, vol. 529, pp. 168-179. Springer, Heidelberg (1991)
7. Babai, L., Luks, E.: Canonical labeling of graphs. In: Proc. 15th ACM Symposium on Theory of Computing, pp. 171-183 (1983)
8. Bodlaender, H.: Dynamic programming on graphs with bounded treewidth. In: Lepistö, T., Salomaa, A. (eds.) Automata, Languages and Programming. LNCS, vol. 317, pp. 105-118. Springer, Heidelberg (1988)
9. Bodlaender, H.: Polynomial algorithm for graph isomorphism and chromatic index on partial k-trees. Journal of Algorithms 11(4), 631-643 (1990)
10. Buss, S.: Alogtime algorithms for tree isomorphism, comparison, and canonization. In: Gottlob, C., Leitsch, A., Mundici, D. (eds.) KGC 1997. LNCS, vol. 1289, pp. 18-33. Springer, Heidelberg (1997)
11. Chandrasekharan, N.: Isomorphism testing of k-trees is in NC Information Processing Letters 34(6), 283-287 (1990)
12. Chandrasekharan, N., Iyengar, S.S.: NC algorithms for recognizing chordal graphs and k trees. IEEE Transactions on Computers 37(10), 1178-1183 (1988)
13. Diestel, R.: Graph Theory. Graduate Texts in Mathematics, vol. 173. Springer, Heidelberg (1997)
14. Gupta, A., Nishimura, N., Proskurowski, A., Ragde, P.: Embeddings of k-connected graphs of pathwidth k. Discrete Applied Mathematics 145(2), 242-265 (2005)
15. Del Greco, J.C., Sekharan, C.N., Sridhar, R.: Fast parallel reordering and isomorphism testing of k-trees. Algorithmica 32(1), 61-72 (2002)
16. Gurevich, Y.: From invariants to canonization. Bulletin of the European Association of Theoretical Computer Science (BEATCS) 63, 115-119 (1997)
17. 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)
18. 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)
19. Klawe, M.M., Corneil, D.C., Proskurowski, A.: Isomorphism testing in hookup classes. SIAM Journal of Algebraic Discrete Methods 3(2), 260-274 (1982)
20. Kloks, T. (ed.): Treewidth. LNCS, vol. 842. Springer, Heidelberg (1994)
21. 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)
22. Luks, E.: Isomorphism of bounded valence can be tested in polynomial time. Journal of Computer and System Sciences 25, 42-65 (1982)
23. Miller, G.L.: Isomorphism of k-contractible graphs. Information and Computation 56(1/2), 1-20 (1983)
24. Proskurowski, A.: Maximal graphs of path-width k or searching a partial k-caterpillar. Technical Report UO-CIS-TR-89-17, University of Oregon (1989)
25. Spielman, D.A.: Faster isomorphism testing of strongly regular graphs. In: Proc. 28th ACM Symposium on Theory of Computing, pp. 576-584. ACM Press, New York (1996)
26. Scheffler, P., Seese, D.: A combinatorial and logical approach to linear-time computability. In: Davenport, J.H. (ed.) ISSAC 1987 and EUROCAL 1987. LNCS, vol. 378, pp. 379-380. Springer, Heidelberg (1989)
27. Wanke, E.: Bounded tree-width and LOGCFL. Journal of Algorithms 16(3), 470-491 (1994)