Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Fully Dynamic Exact Edge Connectivity in Sublinear Time (2302.05951v2)

Published 12 Feb 2023 in cs.DS

Abstract: Given a simple $n$-vertex, $m$-edge graph $G$ undergoing edge insertions and deletions, we give two new fully dynamic algorithms for exactly maintaining the edge connectivity of $G$ in $\tilde{O}(n)$ worst-case update time and $\tilde{O}(m{1-1/31})$ amortized update time, respectively. Prior to our work, all dynamic edge connectivity algorithms either assumed bounded edge connectivity, guaranteed approximate solutions, or were restricted to edge insertions only. Our results provide an affirmative answer to an open question posed by Thorup [Combinatorica'07].

Definition Search Book Streamline Icon: https://streamlinehq.com
References (57)
  1. Graph sparsification in the semi-streaming model. In International Colloquium on Automata, Languages, and Programming (ICALP), pages 328–338, 2009.
  2. Analyzing graph structure via linear measurements. In Symposium on Discrete Algorithms (SODA), pages 459–467, 2012.
  3. Maintaining information in fully dynamic trees with top trees. ACM Transactions on Algorithms (TALG), 1(2):243–264, 2005.
  4. A simple semi-streaming algorithm for global minimum cuts. In Symposium on Simplicity in Algorithms (SOSA), pages 172–180, 2021.
  5. Fully-dynamic graph sparsifiers against an adaptive adversary. In International Colloquium on Automata, Languages, and Programming (ICALP), volume 229 of LIPIcs, pages 20:1–20:20, 2022.
  6. A simple algorithm for minimum cuts in near-linear time. In Scandinavian Symposium and Workshops on Algorithm Theory (SWAT), pages 12:1–12:18, 2020.
  7. A deterministic algorithm for balanced cut with applications to dynamic connectivity, flows, and beyond. In Symposium on Foundations of Computer Science (FOCS), pages 1158–1167, 2020.
  8. A new algorithm for decremental single-source shortest paths with applications to vertex-capacitated flow and cut problems. In Symposium on Theory of Computing (STOC), pages 389–400, 2019.
  9. A unifying framework for ℓ0subscriptℓ0\ell_{0}roman_ℓ start_POSTSUBSCRIPT 0 end_POSTSUBSCRIPT-sampling algorithms. Distributed and Parallel Databases, 32(3):315–335, 2014.
  10. Distributed edge connectivity in sublinear time. In Symposium on Theory of Computing (STOC), pages 343–354, 2019.
  11. Distributed weighted min-cut in nearly-optimal time. In Symposium on Theory of Computing (STOC), pages 1144–1153, 2021.
  12. LR Ford and DR Fulkerson. Flows in networks. 1962.
  13. Greg N Frederickson. Data structures for on-line updating of minimum spanning trees, with applications. SIAM Journal on Computing, 14(4):781–798, 1985.
  14. Greg N Frederickson. Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees. SIAM Journal on Computing, 26(2):484–538, 1997.
  15. Harold N. Gabow. A matroid approach to finding edge connectivity and packing arborescences. Journal of Computer and System Sciences, 50(2):259–273, 1995. Announced at STOC’91.
  16. Minimum cut in o(m log22{{}^{2}}start_FLOATSUPERSCRIPT 2 end_FLOATSUPERSCRIPT n) time. In International Colloquium on Automata, Languages, and Programming (ICALP), pages 57:1–57:15, 2020.
  17. A note on a recent algorithm for minimum cut. In Symposium on Simplicity in Algorithms (SOSA), pages 74–79, 2021.
  18. Parallel minimum cuts in near-linear work and low depth. In Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 1–11, 2018.
  19. Distributed minimum cut approximation. In International Symposium on Distributed Computing (DISC), pages 1–15, 2013.
  20. Congested clique algorithms for the minimum cut problem. In Symposium on Principles of Distributed Computing (PODC), pages 357–366, 2018.
  21. Massively parallel algorithms for minimum cut. In Symposium on Principles of Distributed Computing (PODC), pages 119–128, 2020.
  22. Faster algorithms for edge connectivity via random 2-out contractions. In Symposium on Discrete Algorithms (SODA), pages 1260–1279, 2020.
  23. Multi-terminal network flows. Journal of the Society for Industrial and Applied Mathematics, 9(4):551–570, 1961.
  24. Incremental exact min-cut in polylogarithmic amortized update time. ACM Transactions on Algorithms (TALG), 14(2):1–21, 2018.
  25. The expander hierarchy and its applications to dynamic graph algorithms. In Symposium on Discrete Algorithms (SODA), pages 2212–2228, 2021.
  26. A faster algorithm for finding the minimum cut in a directed graph. J. Algorithms, 17(3):424–446, 1994.
  27. Local flow partitioning for faster edge connectivity. SIAM J. Comput., 49(1):1–36, 2020.
  28. Randomized fully dynamic graph algorithms with polylogarithmic time per operation. Journal of the ACM (JACM), 46(4):502–516, 1999.
  29. Monika Rauch Henzinger. A static 2-approximation algorithm for vertex connectivity and incremental approximation algorithms for edge and vertex connectivity. J. Algorithms, 24(1):194–220, 1997.
  30. Fully dynamic 2-edge connectivity algorithm in polylogarithmic time per operation. SRC Technical Note, 4, 1997.
  31. Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. Journal of the ACM (JACM), 48(4):723–760, 2001.
  32. Dynamic bridge-finding in o (log2 n) amortized time. In Symposium on Discrete Algorithms (SODA), pages 35–52. SIAM, 2018.
  33. Dynamic graph connectivity in polylogarithmic worst case time. In Symposium on Discrete algorithms (SODA), pages 1131–1142, 2013.
  34. David R. Karger. Global min-cuts in rnc, and other ramifications of a simple min-cut algorithm. In Symposium on Discrete Algorithms (SODA), pages 21–30, 1993.
  35. David R. Karger. Using randomized sparsification to approximate minimum cuts. In Symposium on Discrete Algorithms (SODA), pages 424–432, 1994.
  36. David R. Karger. Minimum cuts in near-linear time. Journal of the ACM, 47(1):46–76, 2000. Announced at STOC’96.
  37. A new approach to the minimum cut problem. J. ACM, 43(4):601–640, 1996.
  38. Deterministic edge connectivity in near-linear time. J. ACM, 66(1):4:1–4:50, 2019. Announced at STOC’15.
  39. Min-cuts and shortest cycles in planar graphs in o (n loglogn) time. In European Symposium on Algorithms, pages 155–166. Springer, 2011.
  40. On the cut dimension of a graph. arXiv preprint arXiv:2011.05085, 2020.
  41. Jason Li. Deterministic mincut in almost-linear time. In Symposium on Theory of Computing (STOC), pages 384–395, 2021.
  42. Deterministic min-cut in poly-logarithmic max-flows. In Symposium on Foundations of Computer Science (FOCS), pages 85–92, 2020.
  43. Work-optimal parallel minimum cuts for non-sparse graphs. arXiv preprint arXiv:2102.06565, 2021.
  44. Weighted min-cut: sequential, cut-query, and streaming algorithms. In Symposium on Theory of Computing (STOC), pages 496–509, 2020.
  45. Computing edge-connectivity in multigraphs and capacitated graphs. SIAM J. Discret. Math., 5(1):54–66, 1992.
  46. A linear-time algorithm for finding a sparse k-connected spanning subgraph of ak-connected graph. Algorithmica, 7(1):583–596, 1992.
  47. Dynamic spanning forest with worst-case update time: adaptive, las vegas, and o (n1/2-ε𝜀\varepsilonitalic_ε)-time. In Symposium on Theory of Computing (STOC), pages 1122–1129, 2017.
  48. Dynamic minimum spanning forest with subpolynomial worst-case update time. In Symposium on Foundations of Computer Science (FOCS), pages 950–961, 2017.
  49. Almost-tight distributed minimum cut algorithms. In International Symposium on Distributed Computing (DISC), pages 439–453, 2014.
  50. Merav Parter. Small cuts and connectivity certificates: A fault tolerant approach. arXiv preprint arXiv:1908.03022, 2019.
  51. Fast computation of small cuts via cycle space sampling. ACM Transactions on Algorithms (TALG), 7(4):1–30, 2011.
  52. Computing exact minimum cuts without knowing the graph. arXiv preprint arXiv:1711.03165, 2017.
  53. Thatchaphol Saranurak. A simple deterministic algorithm for edge connectivity. In Symposium on Simplicity in Algorithms (SOSA), pages 80–85, 2021.
  54. Thatchaphol Saranurak and Di Wang. Expander decomposition and pruning: Faster, stronger, and simpler. In Symposium on Discrete Algorithms (SODA), pages 2616–2635, 2019.
  55. A simple min-cut algorithm. J. ACM, 44(4):585–591, 1997.
  56. Mikkel Thorup. Fully-dynamic min-cut. Combinatorica, 27(1):91–127, 2007.
  57. Dynamic graph algorithms with applications. In Scandinavian Workshop on Algorithm Theory (SWAT), pages 1–9. Springer, 2000.
Citations (4)
View on Semantic Scholar

Summary

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

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

Tweets