Experimental study of minimum cut algorithms

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Chandra S. Chekuri Computer Science Department, Stanford University, Stanford, CA
Andrew V. Goldberg NEC Research Institute, Princeton, NJ
David R. Karger Laboratory for Computer Science, MIT, Cambridge, MA
Matthew S. Levine Laboratory for Computer Science, MIT, Cambridge, MA
Cliff Stein Department of Computer Science, Dartmouth College, Hanover, NH
Experimental study of minimum cut algorithms 1997 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 12
· Downloads (12 Months): 68
· Downloads (cumulative): 914
· Citation Count: 40

Published in:
· Proceeding
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Pages 324-333
Society for Industrial and Applied Mathematics Philadelphia, PA, USA ©1997
table of contents ISBN:0-89871-390-0

Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder