Spectral Partitioning, Eigenvalue Bounds, and Circle Packings for Graphs of Bounded Genus
From MaRDI portal
Publication:5470718
DOI10.1137/S0097539705447244zbMath1096.05048MaRDI QIDQ5470718
Publication date: 1 June 2006
Published in: SIAM Journal on Computing (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68W40: Analysis of algorithms
68W05: Nonnumerical algorithms
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Approximating Unique Games Using Low Diameter Graph Decomposition, Short and Simple Cycle Separators in Planar Graphs, Expander graphs, gonality, and variation of Galois representations, Metric uniformization and spectral bounds for graphs, Spectral concentration and greedy \(k\)-clustering, Approximation algorithms via contraction decomposition, Eigenvalues of the Laplacian on the Goldberg-Coxeter constructions for 3- and 4-valent graphs, Upper eigenvalue bounds for the Kirchhoff Laplacian on embedded metric graphs, On the Fiedler value of large planar graphs, Unnamed Item