Pages that link to "Item:Q1154281"

The following pages link to On minimal augmentation of a graph to obtain an interval graph (Q1154281):

Displaying 8 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)
• Minimal interval completion through graph exploration (Q1001896) (← links)
• Interval graphs and related topics (Q1060229) (← 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)
• Cograph editing: Merging modules is equivalent to editing P_4s (Q5121555) (← links)