基于松弛的粗化和多尺度图组织
Relaxation-based coarsening and multiscale graph organization
AI总结:
提出一种新的节点间“接近度”度量,通过少量松弛扫描线性计算,用于多尺度图粗化,并应用于组合优化问题。
摘要:
在本文中,我们通过引入一种新的度量来量化两个节点之间的“接近度”,从而推广并改进了图的多尺度组织。该度量的计算与图中的边数成线性关系,仅涉及少量松弛扫描。然后在每个粗化级别上计算并使用类似的距离概念。我们展示了该度量在几种重要组合优化问题的多尺度方法中的应用,并讨论了多尺度图组织。
英文摘要:
In this paper we generalize and improve the multiscale organization of graphs by introducing a new measure that quantifies the "closeness" between two nodes. The calculation of the measure is linear in the number of edges in the graph and involves just a small number of relaxation sweeps. A similar notion of distance is then calculated and used at each coarser level. We demonstrate the use of this measure in multiscale methods for several important combinatorial optimization problems and discuss the multiscale graph organization.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。