The following pages link to Algorithms – ESA 2005 (Q5475850):
Displaying 7 items.
- Exact algorithms for intervalizing coloured graphs (Q255264) (← links)
- 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)
- Minimal proper interval completions (Q963366) (← links)
- Minimal split completions (Q967310) (← links)
- Minimal interval completion through graph exploration (Q1001896) (← links)
- Dynamically maintaining split graphs (Q1026107) (← links)
