Improved analysis of highest-degree branching for feedback vertex set
From MaRDI portal
Publication:2041981
DOI10.1007/s00453-021-00815-wOpenAlexW2998319348MaRDI QIDQ2041981
Yusuke Kobayashi, Yoichi Iwata
Publication date: 26 July 2021
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.12233
Related Items (8)
A parameterized complexity view on collapsing \(k\)-cores ⋮ Parameterized Complexity of Fair Feedback Vertex Set Problem ⋮ An improved deterministic parameterized algorithm for cactus vertex deletion ⋮ The structural complexity landscape of finding balance-fair shortest paths ⋮ A parameterized algorithm for subset feedback vertex set in tournaments ⋮ Kernelization for feedback vertex set via elimination distance to a forest ⋮ Exact and parameterized algorithms for restricted subset feedback vertex set in chordal graphs ⋮ Exact algorithms for restricted subset feedback vertex set in chordal and split graphs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On feedback vertex set: new measure and new structures
- Exact exponential algorithms.
- Improved algorithms for feedback vertex set problems
- Faster deterministic \textsc{Feedback Vertex Set}
- Half-integrality, LP-branching, and FPT Algorithms
- On Multiway Cut Parameterized above Lower Bounds
- A measure & conquer approach for the analysis of exact algorithms
- The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel
- ON DISJOINT CYCLES
- Faster Parameterized Algorithms Using Linear Programming
- Reducibility among Combinatorial Problems
- Detecting Feedback Vertex Sets of Size k in O*(2.7k) Time
- A naive algorithm for feedback vertex set
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
This page was built for publication: Improved analysis of highest-degree branching for feedback vertex set
