Computing commons interval of K permutations, with applications to modular decomposition of graphs

Anne Bergeron , Cedric Chauve , Fabien de Montgolfier (1) , Mathieu Raffinot

1 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications

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.

Domaines: Algorithme et structure de données [cs.DS]; Bio-informatique [q-bio.QM]; Bio-Informatique, Biologie Systémique [q-bio.QM]

Anne Bergeron, Cedric Chauve, Fabien de Montgolfier, Mathieu Raffinot. Computing commons interval of K permutations, with applications to modular decomposition of graphs. ESA'05, 13th Annual European Symposium on Algorithms, 2005, Majorque, Spain. pp.779-790. ⟨hal-00159580⟩