A Survey on Algorithmic Aspects of Modular Decomposition - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Journal Articles Computer Science Review Year : 2010

A Survey on Algorithmic Aspects of Modular Decomposition

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.

Dates and versions

lirmm-00533514 , version 1 (07-11-2010)

Identifiers

Cite

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

Altmetric

Share

Gmail Facebook X LinkedIn More