On the effectiveness of the incremental approach to minimal chordal edge modification
type: Item
instance of: scholarly article
title: On the effectiveness of the incremental approach to minimal chordal edge modification
author: Jean R. S. Blair
author: Christophe Crespelle
published in: Theoretical Computer Science
publication date: 2021-09-27T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7401217
zbMATH Keywords: chordal graphs
zbMATH Keywords: edge modification
zbMATH Keywords: incremental algorithms
MaRDI profile type: Publication
full work available at URL: j.tcs.2021.07.013
OpenAlex ID: W3186884559
cites work: Fast Quasi-Threshold Editing
cites work: Defining and identifying cograph communities in complex networks
cites work: On the threshold of intractability
cites work: Cluster graph modification problems
cites work: Fixed-parameter tractability of graph modification problems for hereditary properties
cites work: Error compensation in leaf power problems
cites work: On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems
cites work: Interval Completion Is Fixed Parameter Tractable
cites work: A Polynomial Approximation Algorithm for the Minimum Fill-In Problem
cites work: On minimal augmentation of a graph to obtain an interval graph
cites work: A vertex incremental approach for maintaining chordality
cites work: Faster and enhanced inclusion-minimal cograph completion
cites work: Algorithms – ESA 2005
cites work: Minimal comparability completions of arbitrary graphs
cites work: Dynamically maintaining split graphs
cites work: Minimal interval completion through graph exploration
cites work: Characterizing and computing minimal cograph completions
cites work: An \(\mathcal O(n^2)\)-time algorithm for the minimal interval completion problem
cites work: An $$\mathcal {O}(n^2)$$ Time Algorithm for the Minimal Permutation Completion Problem
cites work: Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs
cites work: Inapproximability of Treewidth and Related Problems
cites work: Complexity classification of some edge modification problems
cites work: Incidence matrices and interval graphs
cites work: Minimum Fill-In: Inapproximability and Almost Tight Lower Bounds
DOI: 10.1016/J.TCS.2021.07.013
description: scientific article; zbMATH DE number 7401217