Sciweavers

Share
2 search results - page 1 / 1
» Computing Common Intervals of K Permutations, with Applicati...
Sort
View
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...
WG
2005
Springer
9 years 7 months ago
Algebraic Operations on PQ Trees and Modular Decomposition Trees
Partitive set families are families of sets that can be quite large, but have a compact, recursive representation in the form of a tree. This tree is a common generalization of PQ...
Ross M. McConnell, Fabien de Montgolfier
books