Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs

Anne Bergeron, Cedric Chauve, Fabien de Montgolfier, Mathieu Raffinot. Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs. SIAM J. Discrete Math., 22(3):1022-1039, 2008. [doi]

Authors

Anne Bergeron

This author has not been identified. Look up 'Anne Bergeron' in Google

Cedric Chauve

This author has not been identified. Look up 'Cedric Chauve' in Google

Fabien de Montgolfier

This author has not been identified. Look up 'Fabien de Montgolfier' in Google

Mathieu Raffinot

This author has not been identified. Look up 'Mathieu Raffinot' in Google