ACM DL

SIGN IN   SIGN UP

 
ACM Home Page ACM Digital Library Home Page

Spectral partitioning, eigenvalue bounds, and circle packings for graphs of bounded genus

Full Text: PdfPdf Buy this ArticleBuy this Article
Author: Jonathan A. Kelner Massachusetts Institute of Technology, Cambridge, MA
Published in:
· Proceeding
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
ACM New York, NY, USA ©2004
table of contents ISBN:1-58113-852-0 doi>10.1145/1007352.1007357
Spectral partitioning, eigenvalue bounds, and circle packings for graphs of bounded genus Published by ACM 2004 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 17
· Citation Count: 2


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 © 2012 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