PACE Solver Description: A Heuristic Directed Feedback Vertex Set Problem Algorithm
arXiv:2301.11927
Abstract
A feedback vertex set of a graph is a set of nodes with the property that every cycle contains at least one vertex from the set i.e. the removal of all vertices from a feedback vertex set leads to an acyclic graph. In this short paper, we describe the algorithm for finding a minimum directed feedback vertex set used by the _UAIC_ANDREIARHIRE_ solver, submitted to the heuristic track of the 2022 PACE challenge.
Second best student submission of Heuristic Track of the Feedback Vertex Set Challenge at PACE 2022, https://pacechallenge.org/ https://github.com/AndreiiArhire/PACE2022