Fully-dynamic min-cut

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2001, Pages 224-230

  Thorup, M ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; SAMPLING;

EDGE CONNECTIVITY;

GRAPH THEORY;

EID: 0034830273     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/380752.380804     Document Type: Conference Paper

References (19)

1. Minimizing diameters of dynamic trees
2. Maintaining center and median in dynamic trees
3. Fast probabilistic algorithms for Hamiltonian circuits and matchings
4. Incremental maintenance of the 5-edge-connectivity classes of a graph
5. Sparsification - A technique for speeding up dynamic graph algorithms
6. Separator-based sparsification II: Edge and vertex connectivity
7. Data structures for on-line updating of minimum spanning trees, with applications
8. Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees
9. Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
10. Using randomized sparsification to approximateminimum cuts
11. Minimum cuts in near-linear time
12. Linear time algorithms for finding a sparse k-connected spanning subgraph of a k-connected graph
13. Edge disjoint spanning trees of finite graphs
14. Fast approximation algorithms for fractional packing and covering problems
15. A data structure for dynamic trees
16. Decremental dynamic connectivity
17. Dynamic graph algorithmas with applications (invited talk)
18. On the problem of decomposing a graph into n connected factors
19. Randomized rounding without solving the linear program