Graph partitioning using single commodity flows

doi:10.1145/1538902.1538903

Graph partitioning using single commodity flows

Full Text:

PDF

Buy this Article

Authors:	Rohit Khandekar	IBM Thomas J. Watson Research Center, Hawthorne, New York
	Satish Rao	University of California, Berkeley, CA
	Umesh Vazirani	University of California, Berkeley, CA

Published in:

	· Journal
	Journal of the ACM (JACM) JACM Homepage archive
	Volume 56 Issue 4, June 2009 Article No. 19 ACM New York, NY, USA table of contents doi>10.1145/1538902.1538903

	2009 Article Research Refereed
Bibliometrics
· Downloads (6 Weeks): 7 · Downloads (12 Months): 107 · Downloads (cumulative): 790 · Citation Count: 8

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref

Share:

|

Tags: algorithms edge-separator nonnumerical algorithms and problems single commodity max-flow sparse cut spectral method theory

Feedback | Switch to single page view (no tabs)

**Javascript is not enabled and is required for the "tabbed view" or switch to the single page view**

Powered by

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