Minimal comparability completions of arbitrary graphs
From MaRDI portal
Publication:2476257
Recommendations
- scientific article; zbMATH DE number 966717
- Characterizing and computing minimal cograph completions
- Characterizing and Computing Minimal Cograph Completions
- Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions
- Minimal Split Completions of Graphs
- scientific article; zbMATH DE number 969977
- scientific article; zbMATH DE number 4043898
- On the graph complement conjecture for minimum rank
- On the enumeration of minimal non-pairwise compatibility graphs
- On the enumeration of minimal non-pairwise compatibility graphs
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3706451 (Why is no real title available?)
- scientific article; zbMATH DE number 2079402 (Why is no real title available?)
- A vertex incremental approach for maintaining chordality
- Algorithmic Aspects of Vertex Elimination on Graphs
- Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs
- Complexity classification of some edge modification problems
- Computing minimal triangulations in time \(O(n^{\alpha \log n}) = o(n^{2.376})\)
- Computing the Minimum Fill-In is NP-Complete
- Minimal Interval Completion Through Graph Exploration
- Minimal Proper Interval Completions
- Minimal Split Completions of Graphs
- Minimal fill in O(\(n^{2.69}\)) time
- On Comparability and Permutation Graphs
- Orienting graphs to optimize reachability
Cited in
(15)- An \(\mathcal O(n^2)\)-time algorithm for the minimal interval completion problem
- On the effectiveness of the incremental approach to minimal chordal edge modification
- On the enumeration of minimal non-pairwise compatibility graphs
- Transitive Orientations of Graphs
- Characterizing and computing minimal cograph completions
- Minimal interval completion through graph exploration
- An \(\mathcal {O}(n^2)\) time algorithm for the minimal permutation completion problem
- Characterizing and Computing Minimal Cograph Completions
- Extending partial suborders
- Construction of a transitive orientation using B-stable subgraphs
- A translation of Gallai's paper: `Transitiv orientierbare Graphen'
- An integer programming model for the minimum interval graph completion problem
- Linear-time minimal cograph editing
- Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions
- An \(O(n^2)\) time algorithm for the minimal permutation completion problem
This page was built for publication: Minimal comparability completions of arbitrary graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2476257)
