Pages that link to "Item:Q972335"
From MaRDI portal
The following pages link to Characterizing and computing minimal cograph completions (Q972335):
Displaying 13 items.
- On the effectiveness of the incremental approach to minimal chordal edge modification (Q820555) (← links)
- Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions (Q1001894) (← links)
- Minimal interval completion through graph exploration (Q1001896) (← links)
- An \(O(n^2)\) time algorithm for the minimal permutation completion problem (Q1720313) (← links)
- Minimal obstructions to \(( \infty , k )\)-polarity in cographs (Q2032730) (← links)
- Linear-time minimal cograph editing (Q2140496) (← links)
- Minimal comparability completions of arbitrary graphs (Q2476257) (← links)
- An $$\mathcal {O}(n^2)$$ Time Algorithm for the Minimal Permutation Completion Problem (Q2827805) (← links)
- Bounded search tree algorithms for parametrized cograph deletion: efficient branching rules by exploiting structures of special graph classes (Q2905308) (← links)
- Characterizing and Computing Minimal Cograph Completions (Q3507328) (← 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)
- Trimming forests is hard (unless they are made of stars) (Q6654119) (← links)
