Efficient parallel modular decomposition (extended abstract)
From MaRDI portal
Recommendations
Cites work
- \(P_ 4\)-trees and substitution decomposition
- An Efficient Parallel Biconnectivity Algorithm
- An O(logn) parallel connectivity algorithm
- An O(n2) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs
- Complement reducible graphs
- Deterministic coin tossing with applications to optimal parallel list ranking
- Efficient parallel recognition algorithms of cographs and distance hereditary graphs
- scientific article; zbMATH DE number 1003286 (Why is no real title available?)
- scientific article; zbMATH DE number 1456953 (Why is no real title available?)
- Incremental modular decomposition
- On Comparability and Permutation Graphs
- On Finding Lowest Common Ancestors: Simplification and Parallelization
- Parallel Algorithm for Cograph Recognition with Applications
Cited in
(2)
This page was built for publication: Efficient parallel modular decomposition (extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6122232)