Skip to Main content Skip to Navigation
Journal articles

A Survey on Algorithmic Aspects of Modular Decomposition

Michel Habib 1 Christophe Paul 2
2 ALGCO - Algorithmes, Graphes et Combinatoire
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : The modular decomposition is a technique that applies but is not restricted to graphs. The notion of module naturally appears in the proofs of many graph theoretical theorems. Computing the modular decomposition tree is an important preprocessing step to solve a large number of combinatorial optimization problems. Since the first polynomial time algorithm in the early 70's, the algorithmic of the modular decomposition has known an important development. This paper survey the ideas and techniques that arose from this line of research.
Complete list of metadatas

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00533514
Contributor : Christophe Paul <>
Submitted on : Sunday, November 7, 2010 - 7:43:24 AM
Last modification on : Saturday, March 28, 2020 - 2:22:57 AM

Links full text

Identifiers

Citation

Michel Habib, Christophe Paul. A Survey on Algorithmic Aspects of Modular Decomposition. Computer Science Review, Elsevier, 2010, 4 (1), pp.41-59. ⟨10.1016/j.cosrev.2010.01.001⟩. ⟨lirmm-00533514⟩

Share

Metrics

Record views

356