Affiliation:
1. École Polytechnique Fédérale de Lausanne, Switzerland
2. University of Denver, Denver, CO
Abstract
We describe a new sampling-based method to determine cuts in an undirected graph. For a graph (
V
,
E
), its cycle space is the family of all subsets of
E
that have even degree at each vertex. We prove that with high probability, sampling the cycle space identifies the cuts of a graph. This leads to simple new linear-time sequential algorithms for finding all cut edges and cut pairs (a set of 2 edges that form a cut) of a graph.
In the model of distributed computing in a graph
G
= (
V
,
E
) with
O
(log |
V
|)-bit messages, our approach yields faster algorithms for several problems. The diameter of
G
is denoted by
D
, and the maximum degree by Δ. We obtain simple
O
(
D
)-time distributed algorithms to find all cut edges, 2-edge-connected components, and cut pairs, matching or improving upon previous time bounds. Under natural conditions these new algorithms are universally optimal—that is, a Ω(
D
)-time lower bound holds on every graph. We obtain a
O
(
D
+Δ/log |V|)-time distributed algorithm for finding cut vertices; this is faster than the best previous algorithm when Δ,
D
=
O
(√|
V
|). A simple extension of our work yields the first distributed algorithm with sub-linear time for 3-edge-connected components. The basic distributed algorithms are Monte Carlo, but they can be made Las Vegas without increasing the asymptotic complexity.
In the model of parallel computing on the EREW PRAM, our approach yields a simple algorithm with optimal time complexity
O
(log
V
) for finding cut pairs and 3-edge-connected components.
Publisher
Association for Computing Machinery (ACM)
Subject
Mathematics (miscellaneous)
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Fast Broadcast in Highly Connected Networks;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17
2. Near-optimal distributed computation of small vertex cuts;Distributed Computing;2023-07-14
3. Deterministic Fault-Tolerant Connectivity Labeling Scheme;Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing;2023-06-16
4. Finding a Small Vertex Cut on Distributed Networks;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
5. Fault-Tolerant Labeling and Compact Routing Schemes;Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing;2021-07-21