Spectral partitioning, eigenvalue bounds, and circle packings for graphs of bounded genus
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2005.
Main Author: | Kelner, Jonathan, 1980- |
---|---|
Other Authors: | Daniel Spielman. |
Format: | Thesis |
Language: | eng |
Published: |
Massachusetts Institute of Technology
2006
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/30169 |
Similar Items
-
New geometric techniques for linear programming and graph partitioning
by: Kelner, Jonathan, 1980-
Published: (2007) -
Conditional lower bounds for graph sensitivity problems
by: Ancona, Bertie(Alberto)
Published: (2019) -
Metric uniformization and spectral bounds for graphs
by: Kelner, Jonathan Adam, et al.
Published: (2012) -
A relational framework for bounded program verification
by: Dennis, Gregory D. (Gregory David), 1980-
Published: (2010) -
On a lower bound for the Laplacian eigenvalues of a graph
by: Greaves, Gary Royden Watson, et al.
Published: (2020)