A fast and effective algorithm for the feedback are set problem

A divide-and-conquer approach for the feedback are set is presented. The di vide step is performed by solving a minimum bisection problem. Two strategi es are used to solve minimum bisection problem: A heuristic based on the st ochastic evolution methodology, and a heuristic based on dynamic clustering . Empirical results are presented to compare our method with other approach es. An algorithm to construct test cases for the feedback are set problem w ith known optimal number of feedback arcs, is also presented.