Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs
DOI10.1137/060651331zbMATH Open1190.05044OpenAlexW2091032904MaRDI QIDQ3394985FDOQ3394985
Authors: Anne Bergeron, Cedric Chauve, Fabien De Montgolfier, Mathieu Raffinot 
Publication date: 20 August 2009
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/060651331
Recommendations
Trees (05C05) Discrete mathematics in relation to computer science (68R99) Graph representations (geometric and intersection representations, etc.) (05C62)
Cited In (16)
- Algorithms and Computation
- New applications of interval generators to genome comparison
- Average-case analysis of perfect sorting by reversals
- An algorithm for deciding the finiteness of the number of simple permutations in permutation classes
- Algorithms – ESA 2005
- Fast algorithms to enumerate all common intervals of two permutations
- Common intervals and permutation reconstruction from \textit{MinMax}-betweenness constraints
- A survey of the algorithmic aspects of modular decomposition
- Extending common intervals searching from permutations to sequences
- Common intervals of multiple permutations
- Complete edge-colored permutation graphs
- \textit{MinMax}-profiles: a unifying view of common intervals, nested common intervals and conserved intervals of \(K\) permutations
- Average-Case Analysis of Perfect Sorting by Reversals
- Fully dynamic representations of interval graphs
- A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs
- Title not available (Why is that?)
This page was built for publication: Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3394985)
