Parallel algorithms for minimum cuts and maximum flows in planar networks

Full Text: PDFPDF Buy this ArticleBuy this Article
Author: Donald B. Johnson Dartmouth College, Hanover, NH
Published in:
· Journal
Journal of the ACM (JACM) JACM Homepage archive
Volume 34 Issue 4, Oct. 1987
Pages 950-967
ACM New York, NY, USA
table of contents doi>10.1145/31846.31849
Parallel algorithms for minimum cuts and maximum flows in planar networks Published by ACM 1987 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 21
· Downloads (cumulative): 592
· 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 © 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