Fully-dynamic min-cut
- 6 July 2001
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 224-230
- https://doi.org/10.1145/380752.380804
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Incremental Maintenance of the 5-Edge-Connectivity Classes of a GraphPublished by Springer Nature ,2000
- Minimum cuts in near-linear timeJournal of the ACM, 2000
- Decremental Dynamic ConnectivityJournal of Algorithms, 1999
- Separator-Based Sparsification II: Edge and Vertex ConnectivitySIAM Journal on Computing, 1998
- Sparsification—a technique for speeding up dynamic graph algorithmsJournal of the ACM, 1997
- Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning TreesSIAM Journal on Computing, 1997
- A linear-time algorithm for finding a sparsek-connected spanning subgraph of ak-connected graphAlgorithmica, 1992
- A data structure for dynamic treesJournal of Computer and System Sciences, 1983
- Fast probabilistic algorithms for hamiltonian circuits and matchingsJournal of Computer and System Sciences, 1979
- On the Problem of Decomposing a Graph into n Connected FactorsJournal of the London Mathematical Society, 1961