Characterizing and computing minimal cograph completions
From MaRDI portal
Recommendations
Cites work
- 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?)
- A Linear Recognition Algorithm for Cographs
- A fully dynamic algorithm for modular decomposition and recognition of 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
- Characterizing and Computing Minimal Cograph 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
- Dynamically maintaining split graphs
- 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
- Graph-Theoretic Concepts in Computer Science
- Improved Exponential-Time Algorithms for Treewidth and Minimum Fill-In
- Interval Completion Is Fixed Parameter Tractable
- Minimal Interval Completion Through Graph Exploration
- Minimal Proper Interval Completions
- Minimal Split Completions of Graphs
- Minimal comparability completions of arbitrary 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
(14)- On the effectiveness of the incremental approach to minimal chordal edge modification
- Bounded search tree algorithms for parametrized cograph deletion: efficient branching rules by exploiting structures of special graph classes
- Minimal interval completion through graph exploration
- Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes
- An \(\mathcal {O}(n^2)\) time algorithm for the minimal permutation completion problem
- Single-Edge Monotonic Sequences of Graphs and Linear-Time Algorithms for Minimal Completions and Deletions
- Characterizing and Computing Minimal Cograph Completions
- Minimal obstructions to ( , k )-polarity in cographs
- Minimal comparability completions of arbitrary graphs
- Graph-Theoretic Concepts in Computer Science
- Trimming forests is hard (unless they are made of stars)
- Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions
- Linear-time minimal cograph editing
- An \(O(n^2)\) time algorithm for the minimal permutation completion problem
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 Q972335)
