Many sparse cuts via higher eigenvalues

doi:10.1145/2213977.2214079

Many sparse cuts via higher eigenvalues

Full Text:

PDF

Buy this Article

see source materials below for more options

Authors:	Anand Louis	Georgia Tech, Atlanta, GA, USA
	Prasad Raghavendra	Georgia Tech, Atlanta, GA, USA
	Prasad Tetali	Georgia Tech, Atlanta, GA, USA
	Santosh Vempala	Georgia Tech, Atlanta, GA, USA

	2012 Article
Bibliometrics
· Downloads (6 Weeks): 13 · Downloads (12 Months): 134 · Downloads (cumulative): 134 · Citation Count: 1

Published in:

	· Proceeding
	STOC '12 Proceedings of the 44th symposium on Theory of Computing
	Pages 1131-1140 ACM New York, NY, USA ©2012 table of contents ISBN: 978-1-4503-1245-5 doi>10.1145/2213977.2214079

Tools and Resources

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

Share:

|

Tags: algorithms approximation algorithms cheeger's inequality combinatorial algorithms computations on discrete structures graph eigenvalues graph expansion small-set expansion 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