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.

翻译：图的反馈顶点集是指满足以下性质的节点集：每个环都至少包含该集合中的一个顶点，即从图中移除反馈顶点集中的所有顶点将得到一个无环图。本文简述了用于寻找最小有向反馈顶点集的算法，该算法由 _UAIC_ANDREIARHIRE_ 求解器采用，并提交至2022年PACE挑战赛的启发式赛道。