A Logspace Algorithm for Partial 2-Tree Canonization

2008/05/13 by V. Arvind, Vikraman Arvind, Bireswar Das +1 · 7 citations
Chemistry · Computer Science · Mathematics · #Advanced Graph Theory Research #Algorithm #Algorithms and Data Compression #Chemistry #Combinatorics #Complexity and Algorithms in Graphs #Computer science #Discrete mathematics #Isomorphism (crystallography) #Mathematics #Property (philosophy) #Tree (set theory)

paper · doi:10.1007/978-3-540-79709-8_8

published in Lecture Notes in Computer Science, 40-51 (Springer Berlin Heidelberg)

openalex publication_date 2008/05/13 · crossref created 2008/05/13 · crossref deposited 2021/04/27 · crossref indexed 2025/09/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29

Citations

• The Space Complexity of k-Tree Isomorphism
• Canonical labeling of graphs
• Linear time algorithms for NP-hard problems restricted to partial k-trees
• Random Graph Isomorphism
• Permutation groups and polynomial-time computation

Cited by

• Graph canonization [wikipedia]