Pages that link to "Item:Q2476257"
From MaRDI portal
The following pages link to Minimal comparability completions of arbitrary graphs (Q2476257):
Displaying 15 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)
- Sources and sinks in comparability graphs (Q1368667) (← links)
- Construction of a transitive orientation using B-stable subgraphs (Q1650311) (← links)
- An \(O(n^2)\) time algorithm for the minimal permutation completion problem (Q1720313) (← links)
- Linear-time minimal cograph editing (Q2140496) (← links)
- A translation of Gallai's paper: `Transitiv orientierbare Graphen' (Q2758332) (← links)
- Extending partial suborders (Q2816022) (← 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)
- Characterizing and Computing Minimal Cograph Completions (Q3507328) (← links)
- Faster and enhanced inclusion-minimal cograph completion (Q5915859) (← links)
- On the enumeration of minimal non-pairwise compatibility graphs (Q5918527) (← links)
