Compacting cuts: a new linear formulation for minimum cut

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Robert D. Carr Sandia National Labs, Albuquerque, NM
Goran Konjevod Arizona State University, Tempe, AZ
Greg Little Massachusetts Institute of Technology, Cambridge, MA
Venkatesh Natarajan Carnegie Mellon University, Pittsburgh, PA
Ojas Parekh Emory University, Atlanta, GA
Compacting cuts: a new linear formulation for minimum cut 2007 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 17
· Downloads (cumulative): 225
· Citation Count: 0

Published in:
· Proceeding
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Pages 43-52
Society for Industrial and Applied Mathematics Philadelphia, PA, USA ©2007
table of contents ISBN: 978-0-898716-24-5

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