The complexity of multiway cuts (extended abstract)

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: E. Dahlhaus Department of Computer Science and University of Sidney, New South Wales, Australia and University of Bonn
D. S. Johnson AT&T Bell Laboratories, Murray Hill, NJ
C. H. Papadimitriou Department of Computer Science and Engineering, University of California at San Diego
P. D. Seymour Bellcore, Morristown, NJ
M. Yannakakis AT&T Bell Laboratories, Murray Hill, NJ
The complexity of multiway cuts (extended abstract) Published by ACM 1992 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 5
· Downloads (12 Months): 62
· Downloads (cumulative): 1,044
· Citation Count: 34

Published in:
· Proceeding
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Pages 241-251
ACM New York, NY, USA ©1992
table of contents ISBN:0-89791-511-9 doi>10.1145/129712.129736

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