Fixed-parameter tractability of graph modification problems for hereditary properties
From MaRDI portal
Publication:1352005
Recommendations
Cites work
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 125608 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- scientific article; zbMATH DE number 3286813 (Why is no real title available?)
- Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Algorithmic Aspects of Vertex Elimination on Graphs
- Complement reducible graphs
- Computing the Minimum Fill-In is NP-Complete
- Generating binary trees by transpositions
- Node-Deletion NP-Complete Problems
- Node-and edge-deletion NP-complete problems
- On the complexity of the maximum subgraph problem
Cited in
(only showing first 100 items - show all)- (Sub)linear kernels for edge modification problems toward structured graph classes
- Additive approximation of generalized Turán questions
- Parameterized complexity of vertex deletion into perfect graph classes
- On the Advice Complexity of Online Edge- and Node-Deletion Problems
- Faster FPT algorithms for deletion to pairs of graph classes
- Streaming deletion problems parameterized by vertex cover
- Reconstructing gene trees from Fitch's xenology relation
- Parameterized complexity dichotomy for \((r, \ell)\)-\textsc{Vertex Deletion}
- Dichotomy results on the hardness of \(H\)-free edge modification problems
- Parameterized complexity of the induced subgraph problem in directed graphs
- Two edge modification problems without polynomial kernels
- On structural parameterizations of load coloring
- Parameterized vertex deletion problems for hereditary graph classes with a block property
- Faster parameterized algorithm for cluster vertex deletion
- On the parameterized complexity of contraction to generalization of trees
- Complexity of modification problems for reciprocal best match graphs
- Parameterized enumeration for modification problems
- A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems
- Wheel-Free Deletion Is W[2]-Hard
- Assessing the computational complexity of multi-layer subgraph detection
- Cograph editing: Merging modules is equivalent to editing P_4s
- The birth and early years of parameterized complexity
- Bounded search tree algorithms for parametrized cograph deletion: efficient branching rules by exploiting structures of special graph classes
- Improved kernel and algorithm for claw and diamond free edge deletion based on refined observations
- Graph modification for edge-coloured and signed graph homomorphism problems: parameterized and classical complexity
- Polynomial kernelization for removing induced claws and diamonds
- Characterizing and computing minimal cograph completions
- Online node- and edge-deletion problems with advice
- Parameterized aspects of strong subgraph closure
- Further parameterized algorithms for the \(\mathcal{F}\)-free edge deletion problem
- Obtaining split graphs by edge contraction
- On polynomial kernelization of \(\mathcal H\)-\textsc{free edge deletion}
- Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs
- The PACE 2017 parameterized algorithms and computational experiments challenge: the second iteration
- The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs
- Fixed-parameter tractable distances to sparse graph classes
- On the interval completion of chordal graphs
- Polynomial kernelization for removing induced claws and diamonds
- Vertex deletion into bipartite permutation graphs
- Incompressibility of \(H\)-free edge modification problems: towards a dichotomy
- A polynomial kernel for diamond-free editing
- Conflict free version of covering problems on graphs: classical and parameterized
- A survey of parameterized algorithms and the complexity of edge modification
- Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs
- Computing connected-\(k\)-subgraph cover with connectivity requirement
- Parameterized complexity of deletion to scattered graph classes
- Deletion to scattered graph classes. II: Improved FPT algorithms for deletion to pairs of graph classes
- Parameterized complexity of finding subgraphs with hereditary properties on hereditary graph classes
- Vertex deletion problems on chordal graphs
- A Polynomial Kernel for Diamond-Free Editing
- Minimum fill-in of sparse graphs: kernelization and approximation
- scientific article; zbMATH DE number 7764101 (Why is no real title available?)
- Polynomial kernels for paw-free edge modification problems
- On the parameterized complexity of contraction to generalization of trees
- Structural parameterizations of Tracking Paths problem
- Fixed-treewidth-efficient algorithms for edge-deletion to interval graph classes
- Paths to trees and cacti
- Paths to trees and cacti
- Deleting edges to restrict the size of an epidemic: a new application for treewidth
- Clustering with Partial Information
- Parameterized complexity of finding regular induced subgraphs
- On the Parameterized Approximability of Contraction to Classes of Chordal Graphs
- Editing to Eulerian graphs
- Complexity and parameterized algorithms for cograph editing
- A completeness theory for polynomial (Turing) kernelization
- Deleting edges to restrict the size of an epidemic: a new application for treewidth
- A faster algorithm for the cluster editing problem on proper interval graphs
- Fixed-parameter complexity of minimum profile problems
- Proper interval vertex deletion
- Parameterized complexity of vertex deletion into perfect graph classes
- Polynomial kernels for proper interval completion and related problems
- The cluster deletion problem for cographs
- Faster parameterized algorithms for deletion to split graphs
- An Improved Fixed-Parameter Algorithm for Minimum-Flip Consensus Trees
- Minimal triangulations of graphs: a survey
- Reducing rank of the adjacency matrix by graph modification
- Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs
- A Subexponential Parameterized Algorithm for Proper Interval Completion
- Editing to a planar graph of given degrees
- An \(O^\ast ( 2 . 61 9^k )\) algorithm for 4-path vertex cover
- Closest 4-leaf power is fixed-parameter tractable
- Kernels for packing and covering problems
- On the effectiveness of the incremental approach to minimal chordal edge modification
- The Multi-parameterized Cluster Editing Problem
- Editing to a planar graph of given degrees
- A linear-time algorithm for computing the intersection of all odd cycles in a graph
- Exploring the subexponential complexity of completion problems
- Two edge modification problems without polynomial kernels
- Dynamically maintaining split graphs
- Chordal Deletion Is Fixed-Parameter Tractable
- Complexity classification of some edge modification problems
- Generalized graph clustering: recognizing \((p,q)\)-cluster graphs
- scientific article; zbMATH DE number 7651188 (Why is no real title available?)
- Graph-based data clustering with overlaps
- scientific article; zbMATH DE number 7053390 (Why is no real title available?)
- Obtaining a Planar Graph by Vertex Deletion
- Parameterized complexity of Eulerian deletion problems
- An FPT algorithm for the vertex cover \(P_4\) problem
- A naive algorithm for feedback vertex set
- A fast branching algorithm for cluster vertex deletion
This page was built for publication: Fixed-parameter tractability of graph modification problems for hereditary properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1352005)
