Pages that link to "Item:Q2476257"

The following pages link to Minimal comparability completions of arbitrary graphs (Q2476257):

Displaying 9 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)
• Linear-time minimal cograph editing (Q2140496) (← links)
• An $$\mathcal {O}(n^2)$$ Time Algorithm for the Minimal Permutation Completion Problem (Q2827805) (← links)
• An integer programming model for the Minimum Interval Graph Completion Problem (Q2883618) (← links)
• Faster and enhanced inclusion-minimal cograph completion (Q5915859) (← links)