Approximation and kernelization for chordal vertex deletion
From MaRDI portal
(Redirected from Publication:4586151)
Approximation and kernelization for chordal vertex deletion (scientific article; zbMATH DE number 6935607)
Approximation and kernelization for chordal vertex deletion (scientific article; zbMATH DE number 6935607)
Recommendations
Cites work
- scientific article; zbMATH DE number 2079369 (Why is no real title available?)
- scientific article; zbMATH DE number 3420184 (Why is no real title available?)
- (Meta) kernelization
- A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
- A New Algorithm for Generating All the Maximal Independent Sets
- A Polynomial Kernel for Proper Interval Vertex Deletion
- A Separator Theorem for Chordal Graphs
- A Subexponential Parameterized Algorithm for Proper Interval Completion
- A 4k^2 kernel for feedback vertex set
- A characterisation of rigid circuit graphs
- A cubic kernel for feedback vertex set and loop cutset
- A polynomial kernel for distance-hereditary vertex deletion
- A unified approach to approximating resource allocation and scheduling
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
- Approximation and tidying -- a problem kernel for s-plex cluster vertex deletion
- Chordal Deletion Is Fixed-Parameter Tractable
- Chordal deletion is fixed-parameter tractable
- Chordal editing is fixed-parameter tractable
- Compression via Matroids
- Erdős-Pósa property of chordless cycles and its applications
- Exploring the subexponential complexity of completion problems
- Feedback vertex set inspired kernel for chordal vertex deletion
- Graph Classes: A Survey
- Improved Approximation Algorithms for Minimum Weight Vertex Separators
- Interval deletion is fixed-parameter tractable
- Kernelization -- preprocessing with a guarantee
- Kernelization using structural parameters on sparse graph classes
- Linear recognition of almost interval graphs
- Multiway cuts in node weighted graphs
- Nondeterminism within $P^ * $
- On Independent Circuits Contained in a Graph
- On Linear Time Minor Tests with Depth-First Search
- On diameters and radii of bridged graphs
- Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem
- Parameterized algorithms
- Parameterized complexity of vertex colouring
- Parameterized complexity of vertex deletion into perfect graph classes
- Parametrized complexity theory.
- Preprocessing subgraph and minor problems: when does a small vertex cover help?
- Recent developments in kernelization: a survey
- Recognizing tough graphs is NP-hard
- Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
- Subexponential parameterized algorithm for interval completion
- The Complexity of Multiterminal Cuts
- The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel
- The \(k\)-disjoint paths problem on chordal graphs
- The node-deletion problem for hereditary properties is NP-complete
- Unit interval vertex deletion: fewer vertices are relevant
- Vertex packings: Structural properties and algorithms
- \(O(\sqrt{\log n})\) approximation algorithms for Min UnCut, Min 2CNF deletion, and directed cut problems
Cited in
(36)- Tight bounds for chordal/interval vertex deletion parameterized by treewidth
- Parameterized complexity of vertex deletion into perfect graph classes
- scientific article; zbMATH DE number 7765420 (Why is no real title available?)
- scientific article; zbMATH DE number 7559376 (Why is no real title available?)
- scientific article; zbMATH DE number 7651188 (Why is no real title available?)
- A polynomial kernel for block graph deletion
- Deletion in Abstract Voronoi Diagrams in Expected Linear Time.
- Preprocessing vertex-deletion problems: characterizing graph properties by low-rank adjacencies
- A vertex incremental approach for maintaining chordality
- A polynomial kernel for 3-leaf power deletion
- Chordal Deletion Is Fixed-Parameter Tractable
- On the approximate compressibility of connected vertex cover
- Feedback vertex set inspired kernel for chordal vertex deletion
- Approximation and kernelization for chordal vertex deletion
- Feedback vertex set inspired kernel for chordal vertex deletion
- Erdős-Pósa property of chordless cycles and its applications
- Chordless Cycle Packing Is Fixed-Parameter Tractable
- On the Parameterized Complexity of Clique Elimination Distance
- Vertex deletion problems on chordal graphs
- Search-space reduction via essential vertices
- Parameterized complexity of vertex deletion into perfect graph classes
- Polylogarithmic approximation algorithms for weighted-\(\mathcal{F}\)-deletion problems
- Subexponential parameterized algorithms and kernelization on almost chordal graphs
- Towards constant-factor approximation for chordal/distance-hereditary vertex deletion
- A survey of parameterized algorithms and the complexity of edge modification
- Quadratic vertex kernel for split vertex deletion
- Structural parameterizations with modulator oblivion
- Vertex deletion problems on chordal graphs
- Hitting meets packing: how hard can it be?
- A polynomial kernel for distance-hereditary vertex deletion
- Kernelization through Tidying
- Polynomial Kernel for Interval Vertex Deletion
- Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion
- A constant-factor approximation for weighted bond cover
- On the parameterized complexity of multiway near-separator
- Preprocessing for outerplanar vertex deletion: an elementary kernel of quartic size
This page was built for publication: Approximation and kernelization for chordal vertex deletion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4586151)
