首页/论文/2011.04528

arXiv 2011.045282020-11cs.DSmath.CO

Balanced Crown Decomposition for Connectivity Constraints

Katrin Casel, Tobias Friedrich, Davis Issac, Aikaterini Niklanovits, Ziena Zeif

英文摘要：

We introduce the balanced crown decomposition that captures the structure imposed on graphs by their connected induced subgraphs of a given size. Such subgraphs are a popular modeling tool in various application areas, where the non-local nature of the connectivity condition usually results in very challenging algorithmic tasks. The balanced crown decomposition is a combination of a crown decomposition and a balanced partition which makes it applicable to graph editing as well as graph packing and partitioning problems. We illustrate this by deriving improved kernelization and approximation algorithms for a variety of such problems. In particular, through this structure, we obtain the first constant-factor approximation for the Balanced Connected Partition (BCP) problem, where the task is to partition a vertex-weighted graph into $k$ connected components of approximately equal weight. We derive a 3-approximation for the two most commonly used objectives of maximizing the weight of the lightest component or minimizing the weight of the heaviest component.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

A Note on the Balanced ST-Connectivity

We prove that every YES instance of Balanced ST-Connectivity has a balanced path of polynomial length.

2012-04-03cs.CCcs.DS

结合冠结构的脆弱性度量研究

Combining Crown Structures for Vulnerability Measures

本文针对图的（加权）顶点完整性和组件阶连通性两种脆弱性度量，结合不同冠分解的结构属性提出新型核化算法，显著改进了相关问题的顶点核大小，并为顶点覆盖问题提供了基于冠结构的新核化方法。

2024-11-29cs.DS

A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond

We consider the classical Minimum Balanced Cut problem: given a graph $G$, compute a partition of its vertices into two subsets of roughly equal volume, while minimizing the number of edges connecting the subsets. We present the first {\em deterministic, almost-linear time} approximation algorithm for this problem. Specifically, our algorithm, given an $n$-vertex $m$-edge graph $G$ and any parameter $1\leq r\leq O(\log n)$, computes a $(\log m)^{r^2}$-approximation for Minimum Balanced Cut on $G$, in time $O\left ( m^{1+O(1/r)+o(1)}\cdot (\log m)^{O(r^2)}\right )$. In particular, we obtain a $…

2020-05-03cs.DS

Deterministic Graph Cuts in Subquadratic Time: Sparse, Balanced, and k-Vertex

We study deterministic algorithms for computing graph cuts, with focus on two fundamental problems: balanced sparse cut and $k$-vertex connectivity for small $k$ ($k=O(\polylog n)$). Both problems can be solved in near-linear time with randomized algorithms, but their previous deterministic counterparts take at least quadratic time. In this paper, we break this bound for both problems. Interestingly, achieving this for one problem crucially relies on doing so for the other. In particular, via a divide-and-conquer argument, a variant of the cut-matching game by [Khandekar et al.`07], and the lo…

2019-10-18cs.DS

$l$-精确连通组件顺序的线性核

Linear Kernels for $l$-Exact Component Order Connectivity

本文提出了一种线性核，用于解决$ l $-精确连通组件顺序问题，该问题要求在给定图$ G $和整数$ k $时，是否存在大小不超过$ k $的顶点子集$ S $，使得$ G - S $中的每个连通组件恰好有$ l $个顶点。对于$ l \geq 3 $，这是首个已知的线性核；对于$ l=1 $，该问题退化为经典的顶点覆盖问题，我们的结果与最佳已知的$ 2k $顶点核一致；对于$ l=2 $，即删除到诱导匹配问题，我们得到一个$ (3k + 1) $顶点核，优于之前已知的$ 6k $顶点核。

2026-05-19cs.DS

构建鲁棒且公平的图结构以实现连通性和聚类

Creating Robust and Fair Graph Structures for Connectivity and Clustering

本文研究了图算法在大规模应用中的鲁棒性和聚类结果的公平性，提出了一种双故障容忍的可达性保持结构，以及公平聚类算法框架，改进了公平相关聚类的保证并设计了首个流式公平共识聚类算法。

2026-05-20cs.DS

更多相关论文收起更多论文

Local Flow Partitioning for Faster Edge Connectivity

We study the problem of computing a minimum cut in a simple, undirected graph and give a deterministic $O(m \log^2 n \log\log^2 n)$ time algorithm. This improves both on the best previously known deterministic running time of $O(m \log^{12} n)$ (Kawarabayashi and Thorup, STOC 2015) and the best previously known randomized running time of $O(m \log^{3} n)$ (Karger, J.ACM 2000) for this problem, though Karger's algorithm can be further applied to weighted graphs. Moreover, our result extends to balanced directed graphs, where the balance of a directed graph captures how close the graph is to bei…

2019-11-08cs.DS

Linear Kernels for Separating a Graph into Components of Bounded Size

Graph separation and partitioning are fundamental problems that have been extensively studied both in theory and practice. The \textsc{$p$-Size Separator} problem, closely related to the \textsc{Balanced Separator} problem, is to check whether we can delete at most $k$ vertices in a given graph $G$ such that each connected component of the remaining graph has at most $p$ vertices. This problem is NP-hard for each fixed integer $p\geq 1$ and it becomes the famous \textsc{Vertex Cover} problem when $p=1$. It is known that the problem with parameter $k$ is W[1]-hard for unfixed $p$. In this paper…

2016-08-20cs.DS

TopoBudget：用于可复用社区分析的持久连通性保持Web图稀疏化

TopoBudget: Persistent-Connectivity-Preserving Web Graph Sparsification for Reusable Community Analytics

University of Montana（蒙大拿大学）

TopoBudget是一种保持持久连通性的Web图稀疏化方法，通过提取感知边的持久主干并分配预算，实现多尺度连通性与可复用社区分析，在社区保持和运行效率上优于现有方法。

2026-08-11cs.DScs.SI

通过贪婪再平衡实现高质量多约束超图划分

High-Quality Multi-Constraint Hypergraph Partitioning via Greedy Rebalancing

Karlsruhe Institute of Technology（卡尔斯鲁厄理工学院）

针对多约束超图划分问题，提出基于贪婪局部搜索的再平衡算法，在保证平衡性的同时最小化超边连接度，集成到Mt-KaHyPar后相比Metis连接度降低11.5%。

2026-07-16cs.DCcs.DS

Distributed Algorithms for Large-Scale Graphs

Motivated by the increasing need for fast processing of large-scale graphs, we study a number of fundamental graph problems in a message-passing model for distributed computing, called $k$-machine model, where we have $k$ machines that jointly perform computations on $n$-node graphs. The graph is assumed to be partitioned in a balanced fashion among the $k$ machines, a common implementation in many real-world systems. Communication is point-to-point via bandwidth-constrained links, and the goal is to minimize the round complexity, i.e., the number of communication rounds required to finish a c…

2023-02-09cs.DCcs.DS

Shared-Memory n-level Hypergraph Partitioning

We present a shared-memory algorithm to compute high-quality solutions to the balanced $k$-way hypergraph partitioning problem. This problem asks for a partition of the vertex set into $k$ disjoint blocks of bounded size that minimizes the connectivity metric (i.e., the sum of the number of different blocks connected by each hyperedge). High solution quality is achieved by parallelizing the core technique of the currently best sequential partitioner KaHyPar: the most extreme $n$-level version of the widely used multilevel paradigm, where only a single vertex is contracted on each level. This a…

2021-04-16cs.DCcs.DS