Spectral partitioning, eigenvalue bounds, and circle packings for graphs of bounded genus
DOI10.1145/1007352.1007357zbMath1192.05162OpenAlexW2104380183MaRDI QIDQ3581004
Publication date: 15 August 2010
Published in: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/30169
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)
Related Items
This page was built for publication: Spectral partitioning, eigenvalue bounds, and circle packings for graphs of bounded genus
