Improved Analysis of Highest-Degree Branching for Feedback Vertex Set
Data Structures and Algorithms
2019-05-30 v1
Abstract
Recent empirical evaluations of exact algorithms for Feedback Vertex Set have demonstrated the efficiency of a highest-degree branching algorithm with a degree-based pruning heuristic. In this paper, we prove that this empirically fast algorithm runs in time, where is the solution size. This improves the previous best -time deterministic algorithm obtained by Kociumaka and Pilipczuk.
Keywords
Cite
@article{arxiv.1905.12233,
title = {Improved Analysis of Highest-Degree Branching for Feedback Vertex Set},
author = {Yoichi Iwata and Yusuke Kobayashi},
journal= {arXiv preprint arXiv:1905.12233},
year = {2019}
}