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)- 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
- What's next? Future directions in parameterized complexity
- The PACE 2017 parameterized algorithms and computational experiments challenge: the second iteration
- Graph-based data clustering with overlaps
- Graph-Based Data Clustering with Overlaps
- On the complexity of multi-parameterized cluster editing
- The birth and early years of parameterized complexity
- Fixed-parameter algorithms for cluster vertex deletion
- On the Parameterized Approximability of Contraction to Classes of Chordal Graphs
- Additive approximation of generalized Turán questions
- A basic parameterized complexity primer
- Edge deletion problems: branching facilitated by modular decomposition
- Parameterized complexity dichotomy for \((r, \ell)\)-\textsc{Vertex Deletion}
- Computing connected-\(k\)-subgraph cover with connectivity requirement
- Parameterized Graph Editing with Chosen Vertex Degrees
- Reducing rank of the adjacency matrix by graph modification
- Editing graphs into disjoint unions of dense clusters
- Chordal Deletion Is Fixed-Parameter Tractable
- Parameterized complexity of finding regular induced subgraphs
- Searching for better fill-in
- Reconstructing gene trees from Fitch's xenology relation
- Proper interval vertex deletion
- Fast quasi-threshold editing
- Modifying a graph using vertex elimination
- On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems
- Faster algorithms for cograph edge modification problems
- Two edge modification problems without polynomial kernels
- Fixed-parameter tractable distances to sparse graph classes
- Parameterized algorithms for cluster vertex deletion on degree-4 graphs and general graphs
- Fixed-parameter complexity of minimum profile problems
- Dynamic parameterized problems
- Win-win kernelization for degree sequence completion problems
- Chordal editing is fixed-parameter tractable
- Parameterized complexity of Eulerian deletion problems
- Parameterized complexity of finding subgraphs with hereditary properties.
- On the parameterized complexity of contraction to generalization of trees
- Minimal triangulations of graphs: a survey
- Chordless Cycle Packing Is Fixed-Parameter Tractable
- An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs
- Graph modification for edge-coloured and signed graph homomorphism problems: parameterized and classical complexity
- The Multi-parameterized Cluster Editing Problem
- The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs
- Paths to trees and cacti
- A Polynomial Kernel for Line Graph Deletion
- The parameterized complexity of k-edge induced subgraphs
- A Polynomial Kernel for Diamond-Free Editing
- Parameterized complexity of deletion to scattered graph classes
- Vertex deletion problems on chordal graphs
- Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable
- Faster FPT algorithms for deletion to pairs of graph classes
- Streaming deletion problems parameterized by vertex cover
- scientific article; zbMATH DE number 7053390 (Why is no real title available?)
- Parameterized complexity of vertex deletion into perfect graph classes
- scientific article; zbMATH DE number 7764101 (Why is no real title available?)
- Fixed-treewidth-efficient algorithms for edge-deletion to interval graph classes
- Additive approximation for edge-deletion problems
- Characterizing and Computing Minimal Cograph Completions
- Parameterized coloring problems on chordal graphs
- On structural parameterizations of load coloring
- Subexponential parameterized algorithms and kernelization on almost chordal graphs
- Complexity classification of some edge modification problems
- Faster parameterized algorithm for cluster vertex deletion
- 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
- Obtaining a planar graph by vertex deletion
- On the interval completion of chordal graphs
- Small vertex cover helps in fixed-parameter tractability of graph deletion problems over data streams
- Deleting edges to restrict the size of an epidemic: a new application for treewidth
- Parameterized complexity of Eulerian deletion problems
- Quadratic vertex kernel for split vertex deletion
- Dynamically maintaining split graphs
- Approximation algorithm and FPT algorithm for connected-\(k\)-subgraph cover on minor-free graphs
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)
