高连通图划分:精确建模与求解方法
Highly Connected Graph Partitioning: Exact Formulation and Solution Methods
AI总结:
本文提出高连通图划分 HCGP 的混合整数规划模型、分支切割精确算法及 Q=2 启发式方法,并在真实图实例上验证其有效性与计算代价。
摘要:
图划分(GP)与顶点连通性传统上一直是两个不同的研究领域。本文介绍高连通图划分(HCGP)问题,该问题将图划分为紧凑、规模均衡且对于任意 Q≥1 均为 Q-(顶点)连通的部分。该问题在追求各部分内部凝聚性和容错性的应用中具有价值,例如社交网络中的社区发现,以及以弹性为重点的电力网络划分。关于这一基础互联问题的现有研究主要集中于为有限的稠密图集提供高连通划分的理论存在性保证,并未纳入规模均衡和紧凑性等典型 GP 考量。本文的关键贡献是受政治选区划分问题近期工作启发,为 HCGP 提供一种通用建模与算法方法;政治选区划分是 Q=1 时 HCGP 的一个特例。该方法针对任意 Q≥1,将 Q-连通性约束建模为混合整数规划,并提供一种高效的分支切割法来求解 HCGP。当求解时间比最优性更重要时,本文还提供一种专门为 Q=2 的 HCGP 设计的启发式方法。计算分析使用来自多种真实世界图的实例测试集评估这些方法。在该分析中,分支切割法在一小时内于 82.8% 的已求解实例中找到最优解。对于 Q=2,小型且稀疏的实例对启发式方法具有挑战性,而大型且稀疏的实例对精确方法具有挑战性。此外,与保证 1-连通性的基线相比,本研究量化了使用分支切割方法保证更高连通性的计算成本。总体而言,这项工作可作为将图划分为具有弹性和凝聚性的部分的有效工具。
英文摘要:
Graph partitioning (GP) and vertex connectivity have traditionally been two distinct fields of study. This paper introduces the highly connected graph partitioning (HCGP) problem, which partitions a graph into compact, size balanced, and $Q$-(vertex) connected parts for any $Q\geq 1$. This problem is valuable in applications that seek cohesion and fault-tolerance within their parts, such as community detection in social networks and resiliency-focused partitioning of power networks. Existing research in this fundamental interconnection primarily focuses on providing theoretical existence guarantees of highly connected partitions for a limited set of dense graphs, and do not include canonical GP considerations such as size balance and compactness. This paper's key contribution is providing a general modeling and algorithmic approach for HCGP, inspired by recent work in the political districting problem, a special case of HCGP with $Q=1$. This approach models $Q$-connectivity constraints as mixed integer programs for any $Q\geq 1$ and provides an efficient branch-and-cut method to solve HCGP. When solution time is a priority over optimality, this paper provides a heuristic method specifically designed for HCGP with $Q=2$. A computational analysis evaluates these methods using a test bed of instances from various real-world graphs. In this analysis, the branch-and-cut method finds an optimal solution within one hour in $82.8\%$ of the instances solved. For $Q=2$, small and sparse instances are challenging for the heuristic, whereas large and sparse instances are challenging for the exact method. Furthermore, this study quantifies the computational cost of ensuring higher connectivity using the branch-and-cut approach, compared to a baseline of ensuring $1$-connectivity. Overall, this work serves as an effective tool to partition a graph into resilient and cohesive parts.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。