A survey on algorithmic aspects of modular decomposition
Discrete Mathematics
2009-12-10 v2 Data Structures and Algorithms
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.
Cite
@article{arxiv.0912.1457,
title = {A survey on algorithmic aspects of modular decomposition},
author = {Michel Habib and Christophe Paul},
journal= {arXiv preprint arXiv:0912.1457},
year = {2009}
}