Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms

Abstract : In this paper, a new general decomposition theory inspired from modular graph decomposition is presented. Our main result shows that, within this general theory, most of the nice algorithmic tools developed for modular decomposition are still efficient. This theory not only unifies the usual modular decomposition generalisations such as modular decomposition of directed graphs or decomposition of 2-structures, but also star cutsets and bimodular decomposition. Our general framework provides a decomposition algorithm which improves the best known algorithms for bimodular decomposition.
Document type :
Conference papers
Complete list of metadatas

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00325379
Contributor : Binh-Minh Bui-Xuan <>
Submitted on : Monday, September 29, 2008 - 10:25:40 AM
Last modification on : Wednesday, January 15, 2020 - 4:22:08 PM

Links full text

Identifiers

Citation

Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier. Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms. WG'06: 32th International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2006, Bergen, Norway, pp.278-288, ⟨10.1007/11917496_25⟩. ⟨lirmm-00325379⟩

Share

Metrics

Record views

151