Search-space reduction via essential vertices

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Chordal editing is fixed-parameter tractable
Fundamentals of parameterized complexity
Parameterized complexity of vertex deletion into perfect graph classes
Finding odd cycle transversals.
Improved upper bounds for vertex cover
Experiments on data reduction for optimal domination in networks
Packing non-zero \(A\)-paths in group-labelled graphs
Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover
A cubic kernel for feedback vertex set and loop cutset
Graph minors. V. Excluding a planar graph
NP is as easy as detecting unique solutions
Combinatorial optimization. Polyhedra and efficiency (3 volumes)
Algorithmic graph theory and perfect graphs
Graph minors. XIII: The disjoint paths problem
Measuring what matters: a hybrid approach to dynamic programming with treewidth
On the odd-minor variant of Hadwiger's conjecture
The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
Preprocessing to reduce the search space: antler structures for feedback vertex set
Kernelization – Preprocessing with a Guarantee
Lower Bounds for Kernelization
(Meta) Kernelization
The even-path problem for graphs and digraphs
Presolve Reductions in Mixed Integer Programming
New Hardness Results for Routing on Disjoint Paths
New Limits to Classical and Quantum Instance Compression
A fixed-parameter algorithm for the directed feedback vertex set problem
The Lost Continent of Polynomial Time: Preprocessing and Kernelization
Wheel-Free Deletion Is W[2-Hard]
On the power of unique 2-prover 1-round games
Vertex packings: Structural properties and algorithms
On the Computational Complexity of Combinatorial Problems
Approximation and Kernelization for Chordal Vertex Deletion
Kernelization
Faster Parameterized Algorithms Using Linear Programming
Perturbation Resilience
Representative Sets and Irrelevant Vertices
Parameterized Complexity and Approximability of Directed Odd Cycle Transversal
On the Parameterized Complexity of Approximating Dominating Set
Losing Treewidth by Separating Subsets
On Independent Circuits Contained in a Graph
Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses
Parameterized Algorithms
Detecting Feedback Vertex Sets of Size k in O ^⋆ (2.7 k ) Time
Vertex deletion parameterized by elimination distance and even less

This page was built for publication: Search-space reduction via essential vertices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6606914)