Sorting Heuristics for the Feedback Arc Set Problem ?

@inproceedings{Brandenburg2011SortingHF,
title={Sorting Heuristics for the Feedback Arc Set Problem ?},
author={Franz J. Brandenburg and Kathrin Hanauer},
year={2011}
}

The feedback arc set problem plays a prominent role in the four-phase framework to draw directed graphs, also known as the Sugiyama algorithm. It is equivalent to the linear arrangement problem where the vertices of a graph are ordered from left to right and the backward arcs form the feedback arc set. In this paper we extend classical sorting algorithms to heuristics for the feedback arc set problem. Established algorithms are considered from this point of view, where the directed arcs between… CONTINUE READING