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

DOI10.1145/1007352.1007357MaRDI QIDQ3581004zbMATH OpenOpenAlexFDO

Authors Jonathan Kelner

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

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05) Analysis of algorithms (68W40)

Recommendations

• Spectral Partitioning, Eigenvalue Bounds, and Circle Packings for Graphs of Bounded Genus
• Eigenvalue bounds, spectral partitioning, and metrical deformations via flows
• Linear Algorithms for Partitioning Embedded Graphs of Bounded Genus
• A separator theorem for graphs of bounded genus
• Spectral partitioning works: planar graphs and finite element meshes

Cited in

(5)

• Edge separators for graphs of bounded genus with applications
• A transfer principle and applications to eigenvalue estimates for graphs
• Eigenvalue bounds, spectral partitioning, and metrical deformations via flows
• Spectral Partitioning, Eigenvalue Bounds, and Circle Packings for Graphs of Bounded Genus
• Spectral partitioning works: planar graphs and finite element meshes

This page was built for publication: Spectral partitioning, eigenvalue bounds, and circle packings for graphs of bounded genus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3581004)