Characterizing and Computing Minimal Cograph Completions
From MaRDI portal
Recommendations
- Characterizing and computing minimal cograph completions
- Minimal comparability completions of arbitrary graphs
- Minimal Split Completions of Graphs
- scientific article; zbMATH DE number 969977
- On the graph complement conjecture for minimum rank
- The decomposability of minimum fill-in problems for graphs
- Complete graph minors and the graph minor structure theorem
- Subgraph complementation and minimum rank
Cites work
- A Linear Recognition Algorithm for Cographs
- A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs
- A practical algorithm for making filled graphs minimal
- A simple linear time LexBFS cograph recognition algorithm.
- A vertex incremental approach for maintaining chordality
- Automata, Languages and Programming
- Characterizing Minimal Interval Completions
- Complement reducible 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
- Error compensation in leaf power problems
- Fixed-parameter tractability of graph modification problems for hereditary properties
- Graph Classes: A Survey
- Graph Sandwich Problems
- Graph-Theoretic Concepts in Computer Science
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 1775386 (Why is no real title available?)
- scientific article; zbMATH DE number 3420184 (Why is no real title available?)
- Improved Exponential-Time Algorithms for Treewidth and Minimum Fill-In
- Interval Completion Is Fixed Parameter Tractable
- Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions
- Minimal Interval Completion Through Graph Exploration
- Minimal Proper Interval Completions
- Minimal Split Completions of Graphs
- Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs
- Minimum Fill-in on Circle and Circular-Arc Graphs
- NP-completeness results for edge modification problems
- On treewidth and minimum fill-in of asteroidal triple-free graphs
- Safe separators for treewidth
- Single-Edge Monotonic Sequences of Graphs and Linear-Time Algorithms for Minimal Completions and Deletions
- The complexity of some edge deletion problems
- The minimum degree heuristic and the minimal triangulation process.
- Treewidth and Minimum Fill-in on d-Trapezoid Graphs
- Treewidth and minimum fill-in: Grouping the minimal separators
Cited in
(10)- Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions
- Dynamically maintaining split graphs
- Minimal obstructions to ( , k )-polarity in cographs
- Minimal comparability completions of arbitrary graphs
- Minimal Split Completions of Graphs
- Single-Edge Monotonic Sequences of Graphs and Linear-Time Algorithms for Minimal Completions and Deletions
- Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone
- Graph-Theoretic Concepts in Computer Science
- Strongly chordal and chordal bipartite graphs are sandwich monotone
- Characterizing and computing minimal cograph completions
This page was built for publication: Characterizing and Computing Minimal Cograph Completions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3507328)
