Algorithms for some H-join decompositions

DOI10.1007/978-3-642-29344-3_38MaRDI QIDQ2894487zbMATH OpenOpenAlexFDO

Authors Antoine Mamcarz, Fabien De Montgolfier, Michel Habib

Publication date 29 June 2012

Published in LATIN 2012: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-29344-3_38

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Computing \(H\)-joins with application to 2-modular decomposition
• An algorithm for finding homogeneous pairs
• Graph-Theoretic Concepts in Computer Science
• Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms
• Algorithmic aspects of a general modular decomposition theory

Cited in

(5)

• Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms
• Coloring perfect graphs with no balanced skew-partitions
• Detecting 2-joins faster
• Computing \(H\)-joins with application to 2-modular decomposition
• A polynomial Turing-kernel for weighted independent set in bull-free graphs

This page was built for publication: Algorithms for some \(H\)-join decompositions

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