Fast computation of small cuts via cycle space sampling

DOI10.1145/2000807.2000814zbMath1295.68205arXivcs/0702113OpenAlexW2153507546MaRDI QIDQ3189030

No author found.

Publication date: 9 September 2014

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0702113

zbMATH Keywords

parallel algorithmsgraph connectivityrandomized algorithmsdistributed algorithmslinear algebrauniversal optimality

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40) Randomized algorithms (68W20) Distributed algorithms (68W15)

Related Items (6)

Fast Distributed Approximation for TAP and 2-Edge-Connectivity ⋮ Deterministic Fault-Tolerant Connectivity Labeling Scheme ⋮ Fast distributed approximation for TAP and 2-edge-connectivity ⋮ A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths ⋮ Tree-Based Coarsening and Partitioning of Complex Networks ⋮ A distributed enumeration algorithm and applications to all pairs shortest paths, diameter\dots

This page was built for publication: Fast computation of small cuts via cycle space sampling