The following pages link to Minimal proper interval completions (Q963366):
Displaying 6 items.
- An \(\mathcal O(n^2)\)-time algorithm for the minimal interval completion problem (Q391090) (← links)
- A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
- An \(O(n^2)\) time algorithm for the minimal permutation completion problem (Q1720313) (← links)
- Linear-time minimal cograph editing (Q2140496) (← links)
- An $$\mathcal {O}(n^2)$$ Time Algorithm for the Minimal Permutation Completion Problem (Q2827805) (← links)
- Faster and enhanced inclusion-minimal cograph completion (Q5915859) (← links)
