Almost-Tight Distributed Minimum Cut Algorithms

DOI10.1007/978-3-662-45174-8_30zbMath1435.68381arXiv1408.0557OpenAlexW1508113861MaRDI QIDQ5498702

Hsin-Hao Su, Danupon Nanongkai

Publication date: 10 February 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Distributed algorithms (68W15)

Related Items (8)

Low-congestion shortcuts without embedding ⋮ Fast Distributed Approximation for TAP and 2-Edge-Connectivity ⋮ Fast distributed approximation for TAP and 2-edge-connectivity ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths ⋮ Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear Time

This page was built for publication: Almost-Tight Distributed Minimum Cut Algorithms