Cut structures and randomized algorithms in edge-connectivity problems

Authors:
Andras A. Benczur;Michel X. Goemans
Affiliations:
-;-
Venue:
Cut structures and randomized algorithms in edge-connectivity problems
Year:
1997

Citing 0
Cited 2

A New Approach to Cactus Construction Applied to TSP Support Graphs

Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Perfect matchings via uniform sampling in regular bipartite graphs

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract