On the effectiveness of the incremental approach to minimal chordal edge modification
From MaRDI portal
Publication:820555
DOI10.1016/j.tcs.2021.07.013OpenAlexW3186884559MaRDI QIDQ820555
Jean R. S. Blair, Christophe Crespelle
Publication date: 27 September 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2021.07.013
Cites Work
- An \(\mathcal O(n^2)\)-time algorithm for the minimal interval completion problem
- A vertex incremental approach for maintaining chordality
- Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs
- Characterizing and computing minimal cograph completions
- Minimal interval completion through graph exploration
- Dynamically maintaining split graphs
- On minimal augmentation of a graph to obtain an interval graph
- Fixed-parameter tractability of graph modification problems for hereditary properties
- Cluster graph modification problems
- On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems
- On the threshold of intractability
- Incidence matrices and interval graphs
- Minimal comparability completions of arbitrary graphs
- Error compensation in leaf power problems
- An $$\mathcal {O}(n^2)$$ Time Algorithm for the Minimal Permutation Completion Problem
- Defining and identifying cograph communities in complex networks
- Fast Quasi-Threshold Editing
- Interval Completion Is Fixed Parameter Tractable
- A Polynomial Approximation Algorithm for the Minimum Fill-In Problem
- Minimum Fill-In: Inapproximability and Almost Tight Lower Bounds
- Inapproximability of Treewidth and Related Problems
- Algorithms – ESA 2005
- Faster and enhanced inclusion-minimal cograph completion
- Complexity classification of some edge modification problems
This page was built for publication: On the effectiveness of the incremental approach to minimal chordal edge modification
