A logspace algorithm for partial 2-tree canonization

Authors:
Vikraman 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:
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Year:
2008

Citing 11
Cited 3

Linear time algorithms for NP-hard problems restricted to partial k-trees

Discrete Applied Mathematics
A logspace algorithm for tree canonization (extended abstract)

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Canonical representations of partial 2- and 3-trees

BIT
The graph isomorphism problem: its structural complexity

The graph isomorphism problem: its structural complexity
Paths Problems in Symmetric Logarithmic Space

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
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
Undirected ST-connectivity in log-space

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Canonical labelling of graphs in linear average time

SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
The space complexity of k-tree isomorphism

ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
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

Graphs of bounded treewidth can be canonized in AC1

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

Information and Computation
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 partial 2-tree canonization, and hence isomorphism testing for partial 2-trees, is in deterministic logspace. Our algorithm involves two steps: (a) We exploit the "tree of cycles" property of biconnected partial 2-trees to canonize them in logspace. (b) We analyze Lindell's tree canonization algorithm and show that canonizing general partial 2-trees is also in logspace, using the algorithm to canonize biconnected partial 2-trees.