The following pages link to Minimal split completions (Q967310):
Displaying 13 items.
- An \(\mathcal O(n^2)\)-time algorithm for the minimal interval completion problem (Q391090) (← links)
- Strongly chordal and chordal bipartite graphs are sandwich monotone (Q652637) (← links)
- Minimal proper interval completions (Q963366) (← links)
- Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions (Q1001894) (← links)
- An \(O(n^2)\) time algorithm for the minimal permutation completion problem (Q1720313) (← links)
- Linear-time minimal cograph editing (Q2140496) (← links)
- Recognition of split-graphic sequences (Q2254547) (← links)
- Faster parameterized algorithms for deletion to split graphs (Q2350905) (← links)
- An $$\mathcal {O}(n^2)$$ Time Algorithm for the Minimal Permutation Completion Problem (Q2827805) (← links)
- An integer programming model for the minimum interval graph completion problem (Q2883618) (← links)
- A completely dynamic algorithm for split graphs (Q3439534) (← links)
- Faster and enhanced inclusion-minimal cograph completion (Q5915859) (← links)
- Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes (Q6145807) (← links)
