Fast parallel reordering and isomorphism testing of \(k\)-trees

DOI10.1007/s00453-001-0052-4zbMath0995.68194OpenAlexW1974256367MaRDI QIDQ5956832

No author found.

Publication date: 28 February 2002

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-001-0052-4

zbMATH Keywords

isomorphism problemfast reordering problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Related Items (5)

The Isomorphism Problem for k-Trees Is Complete for Logspace ⋮ Log-space algorithms for paths and matchings in \(k\)-trees ⋮ The Space Complexity of k-Tree Isomorphism ⋮ SELF-STABILIZING ALGORITHMS FOR ORDERINGS AND COLORINGS ⋮ The isomorphism problem for \(k\)-trees is complete for logspace

This page was built for publication: Fast parallel reordering and isomorphism testing of \(k\)-trees