Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
139 tokens/sec
GPT-4o
47 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Cactus Representation of Minimum Cuts: Derandomize and Speed up (2401.10856v1)

Published 19 Jan 2024 in cs.DS

Abstract: Given an undirected weighted graph with $n$ vertices and $m$ edges, we give the first deterministic $m{1+o(1)}$-time algorithm for constructing the cactus representation of \emph{all} global minimum cuts. This improves the current $n{2+o(1)}$-time state-of-the-art deterministic algorithm, which can be obtained by combining ideas implicitly from three papers [Karger JACM'2000, Li STOC'2021, and Gabow TALG'2016] The known explicitly stated deterministic algorithm has a runtime of $\tilde{O}(mn)$ [Fleischer 1999, Nagamochi and Nakao 2000]. Using our technique, we can even speed up the fastest randomized algorithm of [Karger and Panigrahi, SODA'2009] whose running time is at least $\Omega(m\log4 n)$ to $O(m\log3 n)$.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (42)
  1. Maintaining information in fully dynamic trees with top trees. Acm Transactions on Algorithms (talg), 1(2):243–264, 2005.
  2. A simple algorithm for minimum cuts in near-linear time. In Susanne Albers, editor, 17th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2020, June 22-24, 2020, Tórshavn, Faroe Islands, volume 162 of LIPIcs, pages 12:1–12:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
  3. A deterministic algorithm for balanced cut with applications to dynamic connectivity, flows, and beyond. In 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), pages 1158–1167. IEEE, 2020.
  4. Augmenting edge connectivity via isolating cuts. In Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 3237–3252. SIAM, 2022.
  5. Edge connectivity augmentation in near-linear time. In Stefano Leonardi and Anupam Gupta, editors, STOC ’22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20 - 24, 2022, pages 137–150. ACM, 2022.
  6. Distributed weighted min-cut in nearly-optimal time. In Samir Khuller and Virginia Vassilevska Williams, editors, 53rd Annual ACM SIGACT Symposium on Theory of Computing (STOC), pages 1144–1153, 2021.
  7. On the structure of a family of minimum weighted cuts in a graph. Studies in Discrete Optimization, pages 209–306, 1976.
  8. A quick proof for the cactus representation of mincuts. EGRES Quick-Proofs Series, 3, 2009.
  9. Lisa Fleischer. Building chain and cactus representations of all minimum cuts from hao–orlin in the same asymptotic run time. Journal of Algorithms, 33(1):51–72, 1999.
  10. Harold N Gabow. Applications of a poset representation to edge connectivity and graph rigidity. In [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science, pages 812–821. IEEE Computer Society, 1991.
  11. Harold N Gabow. Using expander graphs to find vertex connectivity. Journal of the ACM (JACM), 53(5):800–844, 2006.
  12. Harold N Gabow. The minset-poset approach to representations of graph connectivity. ACM Transactions on Algorithms (TALG), 12(2):1–73, 2016.
  13. Parallel minimum cuts in near-linear work and low depth. ACM Trans. Parallel Comput., 8(2):8:1–8:20, 2021.
  14. Multi-terminal network flows. Journal of the Society for Industrial and Applied Mathematics, 9(4):551–570, 1961.
  15. Incremental exact min-cut in polylogarithmic amortized update time. ACM Transactions on Algorithms (TALG), 14(2):1–21, 2018.
  16. Minimum cut in O⁢(m⁢log2⁡n)𝑂𝑚superscript2𝑛O(m\log^{2}n)italic_O ( italic_m roman_log start_POSTSUPERSCRIPT 2 end_POSTSUPERSCRIPT italic_n ) time. In 47th International Colloquium on Automata, Languages, and Programming, ICALP, 2020.
  17. A linear-time algorithm for a special case of disjoint set union. Journal of computer and system sciences, 30(2):209–221, 1985.
  18. Monika Rauch Henzinger. Approximating minimum cuts under insertions. In International Colloquium on Automata, Languages, and Programming, pages 280–291. Springer, 1995.
  19. Deterministic near-linear time minimum cut in weighted graphs. In Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2024.
  20. A faster algorithm for finding the minimum cut in a graph. In Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms (SODA), 1992.
  21. Local flow partitioning for faster edge connectivity. SIAM Journal on Computing, 49(1):1–36, 2020.
  22. David R Karger. Global min-cuts in rnc, and other ramifications of a simple min-cut algorithm. In SODA, volume 93, pages 21–30. Citeseer, 1993.
  23. David R Karger. Minimum cuts in near-linear time. Journal of the ACM (JACM), 47(1):46–76, 2000.
  24. A near-linear time algorithm for constructing a cactus representation of minimum cuts. In Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 246–255. SIAM, 2009.
  25. A new approach to the minimum cut problem. Journal of the ACM (JACM), 43(4):601–640, 1996.
  26. Efficient algorithm for finding all minimal edge cuts of a nonoriented graph. Cybernetics, 22(2):156–162, 1986.
  27. Deterministic edge connectivity in near-linear time. J. ACM, 66(1):4:1–4:50, 2018.
  28. Jason Li. Deterministic mincut in almost-linear time. In Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, pages 384–395, 2021.
  29. Deterministic min-cut in poly-logarithmic max-flows. In 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), pages 85–92. IEEE, 2020.
  30. Compact cactus representations of all non-trivial min-cuts. Discrete Applied Mathematics, 303, 04 2020.
  31. Weighted min-cut: sequential, cut-query, and streaming algorithms. Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020.
  32. A fast algorithm for optimally increasing the edge connectivity. SIAM Journal on Computing, 26(4):1139–1165, 1997.
  33. Computing edge-connectivity in multigraphs and capacitated graphs. SIAM Journal on Discrete Mathematics, 5(1):54–66, 1992.
  34. A linear-time algorithm for finding a sparse k-connected spanning subgraph of ak-connected graph. Algorithmica, 7(1):583–596, 1992.
  35. Canonical cactus representation for minimum cuts. Japan Journal of Industrial and Applied Mathematics, 11:343–361, 1994.
  36. A fast algorithm for cactus representations of minimum cuts. Japan journal of industrial and applied mathematics, 17(2):245–264, 2000.
  37. Representing and enumerating edge connectivity cuts in rnc. In Workshop on Algorithms and Data Structures, pages 273–285. Springer, 1991.
  38. Approximation algorithms for steiner tree augmentation problems. In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 2429–2448. SIAM, 2023.
  39. Thatchaphol Saranurak. A simple deterministic algorithm for edge connectivity. In Symposium on Simplicity in Algorithms (SOSA), pages 80–85. SIAM, 2021.
  40. A data structure for dynamic trees. Journal of computer and system sciences, 26(3):362–391, 1983.
  41. A simple min-cut algorithm. Journal of the ACM (JACM), 44(4):585–591, 1997.
  42. Deterministic small vertex connectivity in almost linear time, 2023. To appear at SODA’23.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now