Eigenvalue bounds, spectral partitioning, and metrical deformations via flows
From MaRDI portal
Publication:3578197
DOI10.1145/1706591.1706593zbMath1327.05199arXiv0808.0148OpenAlexW2128550154MaRDI QIDQ3578197
No author found.
Publication date: 14 July 2010
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0808.0148
Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Flows in graphs (05C21)
Related Items
Spectral concentration and greedy \(k\)-clustering ⋮ Modularity of minor‐free graphs ⋮ Edge separators for graphs excluding a minor ⋮ Combining temporal partitioning and temporal placement techniques for communication cost improvement ⋮ Unnamed Item ⋮ On the Fiedler value of large planar graphs ⋮ Graph Clustering using Effective Resistance ⋮ Metric uniformization and spectral bounds for graphs ⋮ Approximating Unique Games Using Low Diameter Graph Decomposition ⋮ Comparison of Metric Spectral Gaps ⋮ Multi-way spectral partitioning and higher-order cheeger inequalities ⋮ Unnamed Item ⋮ Cops, Robbers, and Threatening Skeletons: Padded Decomposition for Minor-Free Graphs ⋮ Conformal growth rates and spectral geometry on distributional limits of graphs ⋮ Separators in region intersection graphs ⋮ Sublinear Separators in Intersection Graphs of Convex Shapes ⋮ Upper eigenvalue bounds for the Kirchhoff Laplacian on embedded metric graphs ⋮ Light spanners for high dimensional norms via stochastic decompositions ⋮ Short and Simple Cycle Separators in Planar Graphs
