The following pages link to Algorithms and Computation (Q5897848):
Displaying 8 items.
- A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
- A more efficient algorithm for perfect sorting by reversals (Q963340) (← links)
- Algorithmic aspects of a general modular decomposition theory (Q1026102) (← links)
- Fully dynamic representations of interval graphs (Q1711837) (← links)
- Common intervals and permutation reconstruction from \textit{MinMax}-betweenness constraints (Q1784981) (← links)
- Some families of trees arising in permutation analysis (Q2185210) (← links)
- An algorithm for deciding the finiteness of the number of simple permutations in permutation classes (Q2255003) (← links)
- Competitive graph searches (Q2481952) (← links)
