Abstract
We show that k-tree isomorphism can be decided in logarithmic space by giving a logspace canonical labeling algorithm. This improves over the previous StUL upper bound and matches the lower bound. As a consequence, the isomorphism, the automorphism, as well as the canonization problem for k-trees are all complete for deterministic logspace. We also show that even simple structural properties of k-trees are complete for logspace. © 2009 Springer Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Köbler, J., & Kuhnert, S. (2009). The isomorphism problem for k-trees is complete for logspace. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5734 LNCS, pp. 537–548). https://doi.org/10.1007/978-3-642-03816-7_46
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
