We present a new heuristic algorithm for computing a minimum Feedback Arc Set in directed graphs. The new technique produces solutions that are better than the ones produced by the best previously known heuristics, often reducing the FAS size by more than 50%. It is based on computing the PageRank score of the nodes of the directed line graph of the input directed graph. Although the time required by our heuristic is heavily influenced by the size of the produced line graph, our experimental results show that it runs very fast even for very large graphs used in graph drawing.

翻译：在定向图表中,我们为计算最小反馈弧数据集提供了一种新的超值算法。 新技术产生的解决方案优于最先知的超值理论产生的解决方案, 通常将FAS的大小减少50%以上。 它基于对输入定向图形定向线图的PageRank节点的计算。 尽管我们的超值学所需要的时间受到所制作的线图大小的很大影响, 但我们的实验结果显示,即使对在图形图绘制中使用的非常大的图表, 其运行速度也非常快。