The space complexity of k-tree isomorphism

Authors:
V. Arvind;Bireswar Das;Johannes Köbler
Affiliations:
The Institute of Mathematical Sciences, Chennai, India;The Institute of Mathematical Sciences, Chennai, India;Institut für Informatik, Humboldt Universität zu Berlin, Germany
Venue:
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Year:
2007

Citing 16
Cited 4

NC Algorithms for Recognizing Chordal Graphs and k Trees

IEEE Transactions on Computers
Linear time algorithms for NP-hard problems restricted to partial k-trees

Discrete Applied Mathematics
Isomorphism testing of k-trees is in NC, for fixed k

Information Processing Letters
Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees

Journal of Algorithms
A logspace algorithm for tree canonization (extended abstract)

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Bounded tree-width and LOGCFL

Journal of Algorithms
Faster isomorphism testing of strongly regular graphs

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Dynamic Programming on Graphs with Bounded Treewidth

ICALP '88 Proceedings of the 15th International Colloquium on Automata, Languages and Programming
A combinatorial and logical approach to linear-time computability

EUROCAL '87 Proceedings of the European Conference on Computer Algebra
Unambiguity and Fewness for Logarithmic Space

FCT '91 Proceedings of the 8th International Symposium on Fundamentals of Computation Theory
Alogtime Algorithms for Tree Isomorphism, Comparison, and Canonization

KGC '97 Proceedings of the 5th Kurt Gödel Colloquium on Computational Logic and Proof Theory
Canonical labeling of graphs

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Completeness results for graph isomorphism

Journal of Computer and System Sciences
A Las Vegas - NC algorithm for isomorphism of graphs with bounded multiplicity of eigenvalues

SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Embeddings of k-connected graphs of pathwidth k

Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Testing graph isomorphism in parallel by playing a game

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I

A logspace algorithm for partial 2-tree canonization

CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
The isomorphism problem for k-trees is complete for logspace

Information and Computation
Log-Space Algorithms for Paths and Matchings in k-Trees

Theory of Computing Systems
A computational approach to construct a multivariate complete graph invariant

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that isomorphism testing of k-trees is in the class StUSPACE(log n) (strongly unambiguous logspace). This bound follows from a deterministic logspace algorithm that accesses a strongly unambiguous logspace oracle for canonizing k-trees. Further we give a logspace canonization algorithm for k-paths.