Recommendations
- Minimal Proper Interval Completions
- Algorithms – ESA 2005
- Minimal normal and commuting completions
- scientific article; zbMATH DE number 18526
- Minimal pairs and complete problems
- Minimal split completions
- Minimality and completions of PA
- scientific article; zbMATH DE number 4214076
- Minimal quasi-complete intersection ideals
- Tightly bounded completions
Cites work
- scientific article; zbMATH DE number 4152428 (Why is no real title available?)
- A linear time recognition algorithm for proper interval graphs
- Algorithmic Aspects of Vertex Elimination on Graphs
- Algorithmic graph theory and perfect graphs
- Algorithms – ESA 2005
- Betweenness, orders and interval graphs
- Computing Minimal Triangulations in Time O(nalpha log n) = o(n2.376)
- Fixed-Parameter Tractability and Completeness I: Basic Results
- Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
- Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions
- Minimal Split Completions of Graphs
- Minimal fill in O(\(n^{2.69}\)) time
- Partition refinement techniques: an interesting algorithmic tool kit
- Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques
- Separability generalizes Dirac's theorem
- The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete
- Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs
Cited in
(14)- An \(\mathcal O(n^2)\)-time algorithm for the minimal interval completion problem
- Minimal Interval Completion Through Graph Exploration
- Algorithms – ESA 2005
- Minimal split completions
- On finding the minimum bandwidth of interval graphs
- Minimum proper interval graphs
- An \(\mathcal {O}(n^2)\) time algorithm for the minimal permutation completion problem
- Graphs with at most two moplexes
- Characterizing Minimal Interval Completions
- A survey of the algorithmic aspects of modular decomposition
- On the proper interval completion problem within some chordal subclasses
- Minimal Proper Interval Completions
- Linear-time minimal cograph editing
- An \(O(n^2)\) time algorithm for the minimal permutation completion problem
This page was built for publication: Minimal proper interval completions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q963366)
