Skip to main content
Conference ProceedingsOPEN ACCESS

The space complexity of k-tree isomorphism

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2007) 4835 LNCS 822-833
DOI: 10.1007/978-3-540-77120-3_71
8Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Arvind, V., Das, B., & Köbler, J. (2007). The space complexity of k-tree isomorphism. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4835 LNCS, pp. 822–833). Springer Verlag. https://doi.org/10.1007/978-3-540-77120-3_71

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free