A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension

The first polynomial time algorithm (O(n4 )) for modular decomposition appeared in 1972 [8] and since then there have been incremental improvements, eventually resulting in linear time algorithms [22, 7, 23, 9]. Although an optimal time complexity these algorithms are quite complicated and difficult to implement. In this paper we present an easily implementable linear time algorithm for modular decomposition. This algorithm use the notion of factorizing permutation and a new datastructure, the Ordered Chain Partitions.

• Type: Conference
• Year: 2004
• Where: SWAT
• Authors: Michel Habib, Fabien de Montgolfier, Christophe Paul
• Keywords: Algorithms, Linear Time Algorithm, Modular Decomposition, SWAT 2004, Time Algorithm