PACE Solver Description: A Heuristic Directed Feedback Vertex Set Problem Algorithm

TL;DR

This paper presents a heuristic algorithm for finding minimum directed feedback vertex sets, implemented in the _UAIC_ANDREIARHIRE_ solver, aimed at solving the directed feedback vertex set problem efficiently.

Contribution

It introduces a heuristic algorithm specifically designed for the directed feedback vertex set problem, used in a solver submitted to the 2022 PACE challenge.

Findings

Solver effectively finds minimum feedback vertex sets.

Algorithm performs well on benchmark instances.

Contributes a new heuristic approach for the problem.

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.