Computer Science – Discrete Mathematics
Scientific paper
2009-12-08
Computer Science
Discrete Mathematics
Scientific paper
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.
Habib Michel
Paul Christophe
No associations
LandOfFree
A survey on algorithmic aspects of modular decomposition does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A survey on algorithmic aspects of modular decomposition, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A survey on algorithmic aspects of modular decomposition will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-385809