Pages that link to "Item:Q5459146"
From MaRDI portal
The following pages link to Minimal Interval Completion Through Graph Exploration (Q5459146):
Displaying 6 items.
- Characterizing and computing minimal cograph completions (Q972335) (← 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)
- Minimal comparability completions of arbitrary graphs (Q2476257) (← links)
- Characterizing and Computing Minimal Cograph Completions (Q3507328) (← links)
- Faster and enhanced inclusion-minimal cograph completion (Q5915859) (← links)