On the effectiveness of the incremental approach to minimal chordal edge modification
From MaRDI portal
(Redirected from Publication:820555)
Recommendations
Cites work
- A Polynomial Approximation Algorithm for the Minimum Fill-In Problem
- A vertex incremental approach for maintaining chordality
- Algorithms – ESA 2005
- An \(\mathcal O(n^2)\)-time algorithm for the minimal interval completion problem
- An \(\mathcal {O}(n^2)\) time algorithm for the minimal permutation completion problem
- Characterizing and computing minimal cograph completions
- Cluster graph modification problems
- Complexity classification of some edge modification problems
- Defining and identifying cograph communities in complex networks
- Dynamically maintaining split graphs
- Error compensation in leaf power problems
- Fast quasi-threshold editing
- Fixed-parameter tractability of graph modification problems for hereditary properties
- Inapproximability of treewidth and related problems
- Incidence matrices and interval graphs
- Interval Completion Is Fixed Parameter Tractable
- Minimal comparability completions of arbitrary graphs
- Minimal interval completion through graph exploration
- Minimum Fill-In: Inapproximability and Almost Tight Lower Bounds
- Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs
- On minimal augmentation of a graph to obtain an interval graph
- On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems
This page was built for publication: On the effectiveness of the incremental approach to minimal chordal edge modification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q820555)
