1 code implementation • 29 May 2019 • Yoichi Iwata, Yusuke Kobayashi
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.
Data Structures and Algorithms
2 code implementations • 4 Aug 2016 • Yoichi Iwata
This is the first linear-time polynomial-size kernel for Feedback Vertex Set.
Data Structures and Algorithms
2 code implementations • 10 Oct 2013 • Yoichi Iwata, Magnus Wahlström, Yuichi Yoshida
In addition to the insight into problems with half-integral relaxations, our results yield a range of new and improved FPT algorithms, including an $O^*(|\Sigma|^{2k})$-time algorithm for node-deletion Unique Label Cover with label set $\Sigma$ and an $O^*(4^k)$-time algorithm for Group Feedback Vertex Set, including the setting where the group is only given by oracle access.
Data Structures and Algorithms
