A deterministic near-linear time algorithm for finding minimum cuts in planar graphs

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Parinya Chalermsook Kasetsart University, Bangkok, Thailand
Jittat Fakcharoenphol Kasetsart University, Bangkok, Thailand
Danupon Nanongkai Kasetsart University, Bangkok, Thailand
Published in:
· Proceeding
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Pages 828-829
Society for Industrial and Applied Mathematics Philadelphia, PA, USA ©2004
table of contents ISBN:0-89871-558-X
A deterministic near-linear time algorithm for finding minimum cuts in planar graphs 2004 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 23
· Downloads (cumulative): 414
· Citation Count: 13


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