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
- 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
- On the (Non-)existence of Polynomial Kernels for P l -free Edge Modification Problems
- Proper Interval Vertex Deletion
- The parameterized complexity of \(k\)-edge induced subgraphs
- Obtaining a planar graph by vertex deletion
- Parameterized coloring problems on chordal graphs
- Dynamic parameterized problems
- On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems
- Parameterized complexity of finding connected induced subgraphs
- Applying modular decomposition to parameterized cluster editing problems
- Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs
- Chordal deletion is fixed-parameter tractable
- Parameterized complexity of Eulerian deletion problems
- A basic parameterized complexity primer
- Subexponential parameterized algorithms and kernelization on almost chordal graphs
- A survey of the algorithmic aspects of modular decomposition
- Parameterized complexity of finding subgraphs with hereditary properties.
- Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover
- Editing to a connected graph of given degrees
- On the vertex cover \(P_3\) problem parameterized by treewidth
- Fixed-parameter algorithms for cluster vertex deletion
- Characterizing and Computing Minimal Cograph Completions
- Chordal editing is fixed-parameter tractable
- Parameterized complexity of even/odd subgraph problems
- Improved kernel results for some FPT problems based on simple observations
- Kernel lower bounds using co-nondeterminism: finding induced hereditary subgraphs
- Faster parameterized algorithms for \textsc{Minimum Fill-in}
- What's next? Future directions in parameterized complexity
- Editing graphs into disjoint unions of dense clusters
- Win-win kernelization for degree sequence completion problems
- Parameterized Graph Editing with Chosen Vertex Degrees
- Additive approximation for edge-deletion problems
- Chordal editing is fixed-parameter tractable
- Parameterized complexity of vertex colouring
- Edge deletion problems: branching facilitated by modular decomposition
- Fast quasi-threshold editing
- Maximum locally irregular induced subgraphs via minimum irregulators
- Parameterized algorithms for cluster vertex deletion on degree-4 graphs and general graphs
- Trimming forests is hard (unless they are made of stars)
- Tractability of König edge deletion problems
- An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs
- Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable
- scientific article; zbMATH DE number 7651211 (Why is no real title available?)
- Vertex deletion into bipartite permutation graphs
- Deletion to scattered graph classes. I: Case of finite number of graph classes
- Small vertex cover helps in fixed-parameter tractability of graph deletion problems over data streams
- Structural parameterizations of vertex integrity
- Polynomial kernels for proper interval completion and related problems
- Vertex deletion problems on chordal graphs
- On the complexity of multi-parameterized cluster editing
- A Polynomial Kernel for Line Graph Deletion
- Editing graphs into few cliques: complexity, approximation, and kernelization schemes
- Chordless Cycle Packing Is Fixed-Parameter Tractable
- Parameterized complexity of the \(\mathcal{T}_{h+1} \)-free edge deletion problem
- Modification to Planarity is Fixed Parameter Tractable
- Modifying a graph using vertex elimination
- Reducing rank of the adjacency matrix by graph modification
- Modification problems toward proper (Helly) circular-arc graphs
- \((1,1)\)-cluster editing is polynomial-time solvable
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)
