Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

71

Voted

STOC
2004
ACM

73views Algorithms» more STOC 2004»

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

16 years 3 months ago

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

Download web.mit.edu

In this paper, we address two longstanding questions about finding good separators in graphs of bounded genus and degree:

Jonathan A. Kelner

Real-time Traffic

Algorithms | Longstanding Questions | STOC 2004 |

claim paper

Related Content

» Higher Eigenvalues of Graphs

» Metric uniformization and spectral bounds for graphs

» Embedded in the Shadow of the Separator

» Quasirandomness and Algorithmic Regularity for Graphs with General Degree Distributions

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2004
Where	STOC
Authors	Jonathan A. Kelner

Comments (0)