ACM DL

SIGN IN   SIGN UP

 
ACM Home Page ACM Digital Library Home Page

Fast randomized algorithms for computing minimum {3,4,5,6}-way cuts

Full Text: PDFPDF Buy this ArticleBuy this Article
Author: Matthew S. Levine MIT Laboratory for Computer Science, Cambridge, MA
Published in:
· Proceeding
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Society for Industrial and Applied Mathematics Philadelphia, PA, USA ©2000
table of contents ISBN:0-89871-453-2
Fast randomized algorithms for computing minimum {3,4,5,6}-way cuts 2000 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 8
· Citation Count: 3


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 © 2012 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