Pages that link to "Item:Q3394985"
From MaRDI portal
The following pages link to Computing Common Intervals of <i>K</i> Permutations, with Applications to Modular Decomposition of Graphs (Q3394985):
Displaying 9 items.
- New applications of interval generators to genome comparison (Q414431) (← links)
- A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
- Fully dynamic representations of interval graphs (Q1711837) (← links)
- Common intervals and permutation reconstruction from \textit{MinMax}-betweenness constraints (Q1784981) (← links)
- \textit{MinMax}-profiles: a unifying view of common intervals, nested common intervals and conserved intervals of \(K\) permutations (Q2250447) (← links)
- An algorithm for deciding the finiteness of the number of simple permutations in permutation classes (Q2255003) (← links)
- A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs (Q2672614) (← links)
- Complete edge-colored permutation graphs (Q2672966) (← links)
- AVERAGE-CASE ANALYSIS OF PERFECT SORTING BY REVERSALS (Q2890993) (← links)
