The Isomorphism Problem for k-Trees Is Complete for Logspace

Authors:
Johannes Köbler;Sebastian Kuhnert
Affiliations:
Institut für Informatik, Humboldt Universität zu Berlin, Germany;Institut für Informatik, Humboldt Universität zu Berlin, Germany
Venue:
MFCS '09 Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009
Year:
2009

Citing 0
Cited 6

Interval graphs: canonical representation in logspace

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Graphs of bounded treewidth can be canonized in AC1

CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Interval Graphs: Canonical Representations in Logspace

SIAM Journal on Computing
The isomorphism problem for k-trees is complete for logspace

Information and Computation
Restricted space algorithms for isomorphism on bounded treewidth graphs

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

Theory of Computing Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let V = {x1,...,xn} be a set of variables that range over a set of values D = {d1,...,dq}. A constraint is an expression of the type $R(x_{i_1},\ldots,x_{i_r})$, ...