Pages that link to "Item:Q391090"

The following pages link to An \(\mathcal O(n^2)\)-time algorithm for the minimal interval completion problem (Q391090):

Displaying 9 items.

• On the effectiveness of the incremental approach to minimal chordal edge modification (Q820555) (← links)
• Fully dynamic representations of interval graphs (Q1711837) (← 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)
• A Subexponential Parameterized Algorithm for Proper Interval Completion (Q5899484) (← links)
• Faster and enhanced inclusion-minimal cograph completion (Q5915859) (← links)
• On the proper interval completion problem within some chordal subclasses (Q6635117) (← links)