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. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Bergeron, A., Chauve, C., De Montgolfier, F., & Raffinot, M. (2005). Computing common intervals of K permutations, with applications to modular decomposition of graphs. In Lecture Notes in Computer Science (Vol. 3669, pp. 779–790). Springer Verlag. https://doi.org/10.1007/11561071_69
Mendeley helps you to discover research relevant for your work.