Pages that link to "Item:Q2476257"
From MaRDI portal
The following pages link to Minimal comparability completions of arbitrary graphs (Q2476257):
Displaying 5 items.
- An \(\mathcal O(n^2)\)-time algorithm for the minimal interval completion problem (Q391090) (← links)
- On the effectiveness of the incremental approach to minimal chordal edge modification (Q820555) (← links)
- Characterizing and computing minimal cograph completions (Q972335) (← links)
- Minimal interval completion through graph exploration (Q1001896) (← links)
- An \(O(n^2)\) time algorithm for the minimal permutation completion problem (Q1720313) (← links)
