Given a weighted directed graph $G=(V,E)$ the minimum feedback arc set problem consists of finding a minimum weight set of arcs $E^{\prime}\subseteq E$ such that the directed graph $(V,E/E^{\prime})$ is acyclic. Similarly, the minimum feedback vertex set problem consists of finding a minimum weight set of vertices containing at least one vertex for each directed cycle. In this paper, we have developed a generalized heuristic program DTCPP (decyclization through C++) [17] for decyclization of weighted directed graphs by using simple combinatorial algorithms [5].

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element