Complexity classification of some edge modification problems
From MaRDI portal
Publication:5948964
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3904630 (Why is no real title available?)
- scientific article; zbMATH DE number 176780 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 554763 (Why is no real title available?)
- scientific article; zbMATH DE number 1953109 (Why is no real title available?)
- scientific article; zbMATH DE number 1559516 (Why is no real title available?)
- scientific article; zbMATH DE number 1420899 (Why is no real title available?)
- scientific article; zbMATH DE number 3420184 (Why is no real title available?)
- A Polynomial Approximation Algorithm for the Minimum Fill-In Problem
- A characterization of perfect graphs
- An Application of Duality to Edge-Deletion Problems
- Asteroidal Triple-Free Graphs
- Bounded degree interval sandwich problems
- Complexity and algorithms for reasoning about time
- Computing the Minimum Fill-In is NP-Complete
- Edge-Deletion Problems
- Fixed-parameter tractability of graph modification problems for hereditary properties
- Gadgets, Approximation, and Linear Programming
- Graph Classes: A Survey
- Graph Sandwich Problems
- On intervalizing \(k\)-colored graphs for DNA physical mapping
- On the complexity of DNA physical mapping
- Orienting graphs to optimize reachability
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Some complexity results about threshold graphs
- Some simplified NP-complete graph problems
- The approximation of maximum subgraph problems
- The complexity of some edge deletion problems
- The node-deletion problem for hereditary properties is NP-complete
- The splittance of a graph
- Threshold Numbers and Threshold Completions
- Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs
Cited in
(79)- On the effectiveness of the incremental approach to minimal chordal edge modification
- Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs
- Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs
- Characterizing and computing minimal cograph completions
- Polynomial kernels for 3-leaf power graph modification problems
- Parameterized complexity of even/odd subgraph problems
- Contracting chordal graphs and bipartite graphs to paths and trees
- scientific article; zbMATH DE number 7651188 (Why is no real title available?)
- scientific article; zbMATH DE number 2230201 (Why is no real title available?)
- Further parameterized algorithms for the \(\mathcal{F}\)-free edge deletion problem
- Editing to a connected graph of given degrees
- Cograph editing: Merging modules is equivalent to editing P_4s
- Minimal split completions
- On the complexity of some subgraph problems
- NP-completeness results for edge modification problems
- On listing, sampling, and counting the chordal graphs with edge constraints
- Hardness of edge-modification problems
- Additive approximation of generalized Turán questions
- A vertex incremental approach for maintaining chordality
- Blockers and transversals
- Modifying a graph using vertex elimination
- On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems
- On the computational complexity of the bipartizing matching problem
- Two edge modification problems without polynomial kernels
- Covering tree with stars
- Win-win kernelization for degree sequence completion problems
- Chordal editing is fixed-parameter tractable
- Parameterized complexity of Eulerian deletion problems
- Minimal triangulations of graphs: a survey
- A cubic-vertex kernel for flip consensus tree
- Fixed-treewidth-efficient algorithms for edge-deletion to interval graph classes
- Additive approximation for edge-deletion problems
- Characterizing and Computing Minimal Cograph Completions
- On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints
- Subexponential parameterized algorithms and kernelization on almost chordal graphs
- A quasi-quadratic vertex-kernel for cograph edge editing
- A survey of parameterized algorithms and the complexity of edge modification
- Chordal deletion is fixed-parameter tractable
- Applying modular decomposition to parameterized cluster editing problems
- Deleting edges to restrict the size of an epidemic: a new application for treewidth
- Parameterized complexity of Eulerian deletion problems
- Minimal comparability completions of arbitrary graphs
- Dynamically maintaining split graphs
- Deleting edges to restrict the size of an epidemic: a new application for treewidth
- Matching interdiction
- Two edge modification problems without polynomial kernels
- Splitting plane graphs to outerplanarity
- Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid
- On the proper interval completion problem within some chordal subclasses
- On the (Non-)existence of Polynomial Kernels for P l -free Edge Modification Problems
- Graph editing to a fixed target
- Wheel-Free Deletion Is W[2]-Hard
- Complexity of edge monitoring on some graph classes
- Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone
- Completion to chordal distance-hereditary graphs: a quartic vertex-kernel
- Graph modification problem for some classes of graphs
- Complexity of modification problems for best match graphs
- Faster parameterized algorithms for deletion to split graphs
- On polynomial kernelization of \(\mathcal H\)-\textsc{free edge deletion}
- Splitting plane graphs to outerplanarity
- A new approximate cluster deletion algorithm for diamond-free graphs
- Strongly chordal and chordal bipartite graphs are sandwich monotone
- Efficient algorithms for Eulerian extension
- Contracting chordal graphs and bipartite graphs to paths and trees
- Editing to Eulerian graphs
- Simultaneous consecutive ones submatrix and editing problems: classical complexity and fixed-parameter tractable results
- Incompressibility of \(H\)-free edge modification problems: towards a dichotomy
- Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions
- Prim-based support-graph preconditioners for min-cost flow problems
- Editing graphs into few cliques: complexity, approximation, and kernelization schemes
- Complexity and parameterized algorithms for cograph editing
- Editing to a planar graph of given degrees
- Editing to a planar graph of given degrees
- THE COMPUTATIONAL COMPLEXITY OF AVOIDING FORBIDDEN SUBMATRICES BY ROW DELETIONS
- Orthology relation and gene tree correction: complexity results
- (Sub)linear kernels for edge modification problems toward structured graph classes
- Parameterized complexity of the \(\mathcal{T}_{h+1} \)-free edge deletion problem
- Cluster graph modification problems
- Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs
This page was built for publication: Complexity classification of some edge modification problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5948964)
