The Space Complexity of k-Tree Isomorphism-Reference-Cited by-同舟云学术

The Space Complexity of k-Tree Isomorphism

Published: Issue: Volume: Page:822-833
ISSN:
Container-title:Algorithms and Computation
language:
Short-container-title:

Author:

Arvind V.,Das Bireswar,Köbler Johannes

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-77120-3_71.pdf

Reference27 articles.

1. Allender, E., Lange, K.-J.: RUSPACE(log n) is contained in DSPACE(log2 n/loglog n). Theory of Computing Systems 31, 539–550 (1989)

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. 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)

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Fast Streaming Small Graph Canonization;Complex Networks IX;2018

2. Log-Space Algorithms for Paths and Matchings in k-Trees;Theory of Computing Systems;2013-05-07

3. The Isomorphism Problem for k-Trees Is Complete for Logspace;Mathematical Foundations of Computer Science 2009;2009

4. A Logspace Algorithm for Partial 2-Tree Canonization;Computer Science – Theory and Applications