Preprocessing to reduce the search space: antler structures for feedback vertex set
type: Item
instance of: scholarly article
title: Preprocessing to reduce the search space: antler structures for feedback vertex set
DOI: 10.1007/978-3-030-86838-3_1
author: Huib Donkers
author: Bart M. P. Jansen
publication date: 2022-06-08T00:00:00Z
full work available at URL: https://arxiv.org/abs/2106.11675
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 7538563
zbMATH Keywords: kernelization
zbMATH Keywords: preprocessing
zbMATH Keywords: feedback vertex set
zbMATH Keywords: graph decomposition
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W3204469131
cites work: Crown structures for vertex cover kernelization
cites work: Presolve Reductions in Mixed Integer Programming
cites work: Mixed Integer Programming: Analyzing 12 Years of Progress
cites work: Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover
cites work: Color-coding
cites work: Q5075740
cites work: Center-based clustering under perturbation stability
cites work: A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
cites work: A cubic kernel for feedback vertex set and loop cutset
cites work: (Meta) Kernelization
cites work: Kernelization Lower Bounds by Cross-Composition
cites work: The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel
cites work: Improved upper bounds for vertex cover
cites work: Graph-Theoretic Concepts in Computer Science
cites work: Parameterized Algorithms
cites work: Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses
cites work: Fundamentals of parameterized complexity
cites work: New Limits to Classical and Quantum Instance Compression
cites work: The PACE 2019 Parameterized Algorithms and Computational Experiments Challenge: The Fourth Iteration (Invited Paper)
cites work: The Lost Continent of Polynomial Time: Preprocessing and Kernelization
cites work: Parametrized complexity theory.
cites work: Kernelization
cites work: Infeasibility of instance compression and succinct PCPs for NP
cites work: A completeness theory for polynomial (Turing) kernelization
cites work: Scalable Kernelization for Maximum Independent Sets
cites work: Q5111399
cites work: Reducibility Among Combinatorial Problems
cites work: Representative Sets and Irrelevant Vertices
cites work: Faster Parameterized Algorithms Using Linear Programming
cites work: Vertex packings: Structural properties and algorithms
cites work: Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs
cites work: The Problem of Simplifying Truth Functions
cites work: A 4 k 2 kernel for feedback vertex set
description: scientific article; zbMATH DE number 7538563