Generating All Patterns Of Graph Partitions Within A Disparity Bound
WALCOM: ALGORITHMS AND COMPUTATION, WALCOM 2017(2017)
摘要
A balanced graph partition on a vertex-weighted graph is a partition of the vertex set such that the partition has k parts and the disparity, which is defined as the ratio of the maximum total weight of parts to the minimum one, is at most r. In this paper, a novel algorithm is proposed that enumerates all the graph partitions with small disparity. Experimental results show that five millions of partitions with small disparity for some graph with more than 100 edges can be enumerated within ten minutes.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络