Fast parallel reordering and isomorphism testing of k-trees

DOI10.1007/S00453-001-0052-4zbMATH Open0995.68194OpenAlexW1974256367MaRDI QIDQ5956832FDOQ5956832

Authors: J. G. Del Greco, C. N. Sekharan, Ranjana Sridhar 

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

Recommendations

• scientific article; zbMATH DE number 4213471
• scientific article; zbMATH DE number 54593
• Faster algorithms for subgraph isomorphism of \(k\)-connected partial \(k\)-trees
• Faster algorithms for subgraph isomorphism of \(k\)-connected partial \(k\)-trees
• Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism
• Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism
• Parallel computation of matchings in trees
• Parallel Algorithms with Optimal Speedup for Bounded Treewidth
• Parallel algorithms with optimal speedup for bounded treewidth
• scientific article; zbMATH DE number 4041265

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)

Cited In (7)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5956832)