HAL: hal-00159580, version 1

Detailed view

Export this paper BibTeX - EndNote - TEI - RefWorks -

ESA'05, 13th Annual European Symposium on Algorithms, Majorque : Espagne (2005)

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

Anne Bergeron, Cedric Chauve, Fabien De Montgolfier (  Corresponding author ) 1, Mathieu Raffinot

(2005)

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.

1:	Laboratoire d'informatique Algorithmique : Fondements et Applications (LIAFA)
	CNRS : UMR7089 – Université Paris VII - Paris Diderot

Subject

:

Computer Science/Data Structures and Algorithms Computer Science/Bioinformatics Life Sciences/Quantitative Methods

hal-00159580, version 1

http://hal.archives-ouvertes.fr/hal-00159580

oai:hal.archives-ouvertes.fr:hal-00159580

From: Fabien De Montgolfier <>

Submitted on: Tuesday, 3 July 2007 15:43:00

Updated on: Tuesday, 3 July 2007 19:48:34