有向图的最优分割与最少反馈弧数
Optimal segmentation of directed graph and the minimum number of feedback arcs
摘要:
最小反馈弧集问题要求从一个有向图中删除最少数量的弧(有向边),使其不含任何有向圈。在这项工作中,我们接近这个基本的循环约束优化问题,考虑一个广义的任务划分成D层的大小相等的有向图。我们解决了D-分割问题的复制对称平均场论和信念传播启发式算法。然后将理论结果外推到大D的极限,得到了给定随机有向图系综的最小反馈弧密度。设计了一种求解最小反馈弧集问题的分而治之算法(nested-BPR)。
英文摘要:
The minimum feedback arc set problem asks to delete a minimum number of arcs (directed edges) from a digraph (directed graph) to make it free of any directed cycles. In this work we approach this fundamental cycle-constrained optimization problem by considering a generalized task of dividing the digraph into D layers of equal size. We solve the D-segmentation problem by the replica-symmetric mean field theory and belief-propagation heuristic algorithms. The minimum feedback arc density of a given random digraph ensemble is then obtained by extrapolating the theoretical results to the limit of large D. A divide-and-conquer algorithm (nested-BPR) is devised to solve the minimum feedback arc set problem with very good performance and high efficiency.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。