Sciweavers

Share
ESA
2005
Springer
131views Algorithms» more  ESA 2005»
9 years 8 months ago
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 an...
Anne Bergeron, Cedric Chauve, Fabien de Montgolfie...
books