Fixed-parameter tractability of graph modification problems for hereditary properties
From MaRDI portal
(Redirected from 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)- Deleting edges to restrict the size of an epidemic: a new application for treewidth
- Parameterized aspects of strong subgraph closure
- Clustering with partial information
- Kernel lower bounds using co-nondeterminism: finding induced hereditary subgraphs
- Two edge modification problems without polynomial kernels
- Closest 4-leaf power is fixed-parameter tractable
- \((1,1)\)-cluster editing is polynomial-time solvable
- An FPT algorithm for the vertex cover \(P_4\) problem
- A survey of the algorithmic aspects of modular decomposition
- Polynomial kernels for paw-free edge modification problems
- Structural parameterization of cluster deletion
- Vertex deletion into bipartite permutation graphs
- Obtaining split graphs by edge contraction
- Vertex deletion problems on chordal graphs
- A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems
- Complexity of modification problems for reciprocal best match graphs
- Cluster editing for multi-layer and temporal graphs
- On the (Non-)existence of Polynomial Kernels for P l -free Edge Modification Problems
- Proper Interval Vertex Deletion
- Distance from triviality 2.0: hybrid parameterizations
- Reducing rank of the adjacency matrix by graph modification
- Obtaining a Planar Graph by Vertex Deletion
- Minimum fill-in of sparse graphs: kernelization and approximation
- Parameterized complexity of vertex colouring
- Chordal editing is fixed-parameter tractable
- Wheel-Free Deletion Is W[2]-Hard
- Completion to chordal distance-hereditary graphs: a quartic vertex-kernel
- Faster parameterized algorithms for deletion to split graphs
- On polynomial kernelization of \(\mathcal H\)-\textsc{free edge deletion}
- Modification problems toward proper (Helly) circular-arc graphs
- Clustering with Partial Information
- A faster algorithm for the cluster editing problem on proper interval graphs
- Trimming forests is hard (unless they are made of stars)
- Parameterized aspects of strong subgraph closure
- A completeness theory for polynomial (Turing) kernelization
- An \(O^\ast ( 2 . 61 9^k )\) algorithm for 4-path vertex cover
- Dichotomy results on the hardness of \(H\)-free edge modification problems
- Generalized graph clustering: recognizing \((p,q)\)-cluster graphs
- Editing to Eulerian graphs
- On the Advice Complexity of Online Edge- and Node-Deletion Problems
- Deletion to scattered graph classes. I: Case of finite number of graph classes
- Structural parameterizations of vertex integrity
- Faster parameterized algorithms for \textsc{Minimum Fill-in}
- Exploring the subexponential complexity of completion problems
- Incompressibility of \(H\)-free edge modification problems: towards a dichotomy
- A polynomial kernel for diamond-free editing
- Polynomial kernelization for removing induced claws and diamonds
- Structural parameterizations of Tracking Paths problem
- A cubic vertex-kernel for \textsc{Trivially Perfect Editing}
- Improved kernel and algorithm for claw and diamond free edge deletion based on refined observations
- Improved kernel results for some FPT problems based on simple observations
- Maximum locally irregular induced subgraphs via minimum irregulators
- Kernels for packing and covering problems
- Polynomial kernels for proper interval completion and related problems
- Editing graphs into few cliques: complexity, approximation, and kernelization schemes
- Polynomial kernelization for removing induced claws and diamonds
- Complexity and parameterized algorithms for cograph editing
- Editing to a planar graph of given degrees
- Tractability of König edge deletion problems
- A naive algorithm for feedback vertex set
- Parameterized complexity of the induced subgraph problem in directed graphs
- Parameterized vertex deletion problems for hereditary graph classes with a block property
- Editing to a planar graph of given degrees
- Online node- and edge-deletion problems with advice
- Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs
- scientific article; zbMATH DE number 7651211 (Why is no real title available?)
- On the parameterized complexity of contraction to generalization of trees
- (Sub)linear kernels for edge modification problems toward structured graph classes
- Parameterized complexity of the \(\mathcal{T}_{h+1} \)-free edge deletion problem
- A linear-time algorithm for computing the intersection of all odd cycles in a graph
- Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs
- Streaming deletion problems Parameterized by vertex cover
- Parameterized complexity of vertex deletion into perfect graph classes
- Polynomial kernels for proper interval completion and related problems
- The cluster deletion problem for cographs
- A Subexponential Parameterized Algorithm for Proper Interval Completion
- On the effectiveness of the incremental approach to minimal chordal edge modification
- A fast branching algorithm for cluster vertex deletion
- Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs
- Vertex deletion into bipartite permutation graphs
- Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs
- Modification to Planarity is Fixed Parameter Tractable
- Characterizing and computing minimal cograph completions
- Parameterized complexity of even/odd subgraph problems
- On structural parameterizations of load coloring
- scientific article; zbMATH DE number 7651188 (Why is no real title available?)
- Conflict free version of covering problems on graphs: classical and parameterized
- Parameterized enumeration for modification problems
- Bounded search tree algorithms for parametrized cograph deletion: efficient branching rules by exploiting structures of special graph classes
- Parameterized complexity of finding subgraphs with hereditary properties on hereditary graph classes
- Assessing the computational complexity of multi-layer subgraph detection
- Parameterized complexity of finding connected induced subgraphs
- Further parameterized algorithms for the \(\mathcal{F}\)-free edge deletion problem
- Editing to a connected graph of given degrees
- On the vertex cover \(P_3\) problem parameterized by treewidth
- Cograph editing: Merging modules is equivalent to editing P_4s
- Paths to trees and cacti
- An Improved Fixed-Parameter Algorithm for Minimum-Flip Consensus Trees
- Deletion to scattered graph classes. II: Improved FPT algorithms for deletion to pairs of graph classes
- Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover
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)
