Improved analysis of highest-degree branching for feedback vertex set
type: Item
instance of: scholarly article
title: Improved analysis of highest-degree branching for feedback vertex set
author: Yoichi Iwata
author: Yusuke Kobayashi
published in: Algorithmica
publication date: 2021-07-26T00:00:00Z
full work available at URL: https://arxiv.org/abs/1905.12233
full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2019/11483/
Mathematics Subject Classification ID: 68Wxx
Mathematics Subject Classification ID: 05Cxx
zbMATH DE Number: 7374881
zbMATH Keywords: parameterized complexity
zbMATH Keywords: feedback vertex set
zbMATH Keywords: branch and bound
zbMATH Keywords: measure and conquer
MaRDI profile type: Publication
OpenAlex ID: W2998319348
cites work: Q4488089
cites work: ON DISJOINT CYCLES
cites work: The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel
cites work: A naive algorithm for feedback vertex set
cites work: On feedback vertex set: new measure and new structures
cites work: Improved algorithms for feedback vertex set problems
cites work: Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
cites work: On Multiway Cut Parameterized above Lower Bounds
cites work: Q4281497
cites work: A measure & conquer approach for the analysis of exact algorithms
cites work: Exact exponential algorithms.
cites work: Q5111399
cites work: Q5875556
cites work: Half-integrality, LP-branching, and FPT algorithms
cites work: Reducibility among Combinatorial Problems
cites work: Q5140722
cites work: Faster deterministic \textsc{Feedback Vertex Set}
cites work: Detecting Feedback Vertex Sets of Size k in O*(2.7k) Time
cites work: Faster Parameterized Algorithms Using Linear Programming
DOI: 10.1007/S00453-021-00815-W
describes a project that uses: GitHub
description: scientific article; zbMATH DE number 7374881