Pages that link to "Item:Q1001896"
From MaRDI portal
The following pages link to Minimal interval completion through graph exploration (Q1001896):
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)
- An integer programming model for the minimum interval graph completion problem (Q2883618) (← links)
- (Q3836537) (← links)
- Faster and enhanced inclusion-minimal cograph completion (Q5915859) (← links)