scientific article; zbMATH DE number 7286685

DOI10.4230/LIPIcs.SEA.2018.12zbMath1493.68274arXiv1803.00925MaRDI QIDQ5140722

Krzysztof Kiljan, Marcin Pilipczuk

Publication date: 16 December 2020

Full work available at URL: https://arxiv.org/abs/1803.00925

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

feedback vertex setempirical evaluation of algorithms

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85) Parameterized complexity, tractability and kernelization (68Q27)

Related Items

Exploiting Database Management Systems and Treewidth for Counting, Unnamed Item, Improved analysis of highest-degree branching for feedback vertex set

Uses Software

• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
• Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover
• Improved algorithms for feedback vertex set problems
• A cubic kernel for feedback vertex set and loop cutset
• An augmenting path algorithm for linear matroid parity
• Faster deterministic \textsc{Feedback Vertex Set}
• An \(\mathcal O(2^{O(k)}n^{3})\) FPT algorithm for the undirected feedback vertex set problem
• Half-integrality, LP-branching, and FPT Algorithms
• A 4 k ² kernel for feedback vertex set
• Faster fixed parameter tractable algorithms for finding feedback vertex sets
• The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel
• On Feedback Vertex Set New Measure and New Structures
• ON DISJOINT CYCLES
• Reducibility among Combinatorial Problems
• A naive algorithm for feedback vertex set
• Parameterized and Exact Computation
• Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
• Parameterized Algorithms