Faster Algorithms for Edge Connectivity via Random 2-Out Contractions

DOI10.1137/1.9781611975994.77OpenAlexW3000941460MaRDI QIDQ5146849

Mikkel Thorup, Krzysztof Nowicki, Mohsen Ghaffari

Publication date: 2 February 2021

Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (4)

Faster connectivity in low-rank hypergraphs via expander decomposition ⋮ Unnamed Item ⋮ Faster cut sparsification of weighted graphs ⋮ Near-optimal scheduling in the congested clique

This page was built for publication: Faster Algorithms for Edge Connectivity via Random 2-Out Contractions