Computing \(H\)-joins with application to 2-modular decomposition

DOI10.1007/s00453-013-9820-1zbMath1306.05235OpenAlexW2068211971MaRDI QIDQ486993

Antoine Mamcarz, Fabien de Montgolfier, Michel A. Habib

Publication date: 19 January 2015

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-013-9820-1

zbMATH Keywords

graph decompositions\(H\)-joinhomogeneous pairs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• A survey of the algorithmic aspects of modular decomposition
• An algorithm for finding homogeneous pairs
• Boolean-width of graphs
• \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth
• Bull-free Berge graphs are perfect
• Partitive hypergraphs
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• Balanced \(0,\pm 1\) matrices. I: Decomposition
• Detecting 2-joins faster
• Algorithms for Some H-Join Decompositions
• Linear Time Split Decomposition Revisited
• Three Partition Refinement Algorithms
• A Combinatorial Decomposition Theory
• List Partitions
• PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KIT

This page was built for publication: Computing \(H\)-joins with application to 2-modular decomposition