Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms

DOI10.1007/11917496_25MaRDI QIDQ3522965zbMATH OpenOpenAlexFDO

Authors B.-M. Bui Xuan, Vincent Limouzy, Fabien De Montgolfier, M. A. Habib

Publication date 4 September 2008

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

Full work available at URL https://doi.org/10.1007/11917496_25

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Algorithmic aspects of a general modular decomposition theory
• Unifying Two Graph Decompositions with Modular Decomposition
• scientific article; zbMATH DE number 512929
• Algorithms for some \(H\)-join decompositions
• scientific article; zbMATH DE number 1456953

Cited in

(4)

• On Modular Decomposition Concepts: the case for Homogeneous Relations
• Decompositions and forcing relations in graphs and other combinatorial structures
• Unifying Two Graph Decompositions with Modular Decomposition
• Algorithms for some \(H\)-join decompositions

This page was built for publication: Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms

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