Efficient parallel modular decomposition (extended abstract)

DOI10.1007/3-540-60618-1_83OpenAlexW1568727548MaRDI QIDQ6122232

Elias Dahlhaus

Publication date: 28 February 2024

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60618-1_83

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity

Cites Work

• Unnamed Item
• Unnamed Item
• Complement reducible graphs
• \(P_ 4\)-trees and substitution decomposition
• Efficient parallel recognition algorithms of cographs and distance hereditary graphs
• Parallel Algorithm for Cograph Recognition with Applications
• On Comparability and Permutation Graphs
• An Efficient Parallel Biconnectivity Algorithm
• Deterministic coin tossing with applications to optimal parallel list ranking
• On Finding Lowest Common Ancestors: Simplification and Parallelization
• Incremental modular decomposition
• 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

This page was built for publication: Efficient parallel modular decomposition (extended abstract)