SIGN IN
SIGN UP
A new approach to the minimum cut problem
Full Text:
PDF
Buy this Article
Authors:
David R. Karger
Massachusetts Institute of Technology, Cambridge
Clifford Stein
Dartmouth College, Hanover, NH
Published in:
· Journal
Journal of the ACM (JACM)
JACM Homepage
archive
Volume 43 Issue 4, July 1996
Pages 601-640
ACM
New York, NY
, USA
table of contents
doi>
10.1145/234533.234534
1996 Article
Bibliometrics
· Downloads (6 Weeks): 26
· Downloads (12 Months): 197
· Downloads (cumulative): 3,284
· Citation Count: 75
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
graph algorithm
graph algorithms
minimum cut
network problems
network reliability
nonnumerical algorithms and problems
parallel computing
probabilistic algorithms
randomized algorithm
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder