Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs

We introduce a new way to compute common intervals of K permutations based on a very simple and general notion of generators of common intervals. This formalism leads to simple and efficient algorithms to compute the set of all common intervals of K permutations, that can contain a quadratic number of intervals, as well as a linear space basis of this set of common intervals. Finally, we show how our results on permutations can be used for computing the modular decomposition of graphs in linear time.

• Type: Conference
• Year: 2005
• Where: ESA
• Authors: Anne Bergeron, Cedric Chauve, Fabien de Montgolfier, Mathieu Raffinot
• Keywords: Common Intervals, ESA 2005, Linear Space Basis, Permutations