On the Quality of Spectral Separators
From MaRDI portal
Publication:4389101
DOI10.1137/S0895479896312262zbMath0905.05050MaRDI QIDQ4389101
Stephen Guattery, Gary Lee Miller
Publication date: 11 May 1998
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (21)
Graph Laplacians, nodal domains, and hyperplane arrangements ⋮ Combinatorial characterization of the null spaces of symmetric H-matrices ⋮ On the maximal error of spectral approximation of graph bisection ⋮ Improvements on Spectral Bisection ⋮ Spectral bisection with two eigenvectors ⋮ Consistency of spectral clustering ⋮ A spectral method to detect community structure based on distance modularity matrix ⋮ Effective Resistance Preserving Directed Graph Symmetrization ⋮ On the eigenvectors of \(p\)-Laplacian ⋮ Graph clustering ⋮ A note on edge-based graph partitioning and its linear algebraic structure ⋮ Approximating Spectral Clustering via Sampling: A Review ⋮ Mean curvature, threshold dynamics, and phase field theory on finite graphs ⋮ On the Laplacian Eigenvalues of Gn,p ⋮ Graph clustering, variational image segmentation methods and Hough transform scale detection for object measurement in images ⋮ Diffuse Interface Models on Graphs for Classification of High Dimensional Data ⋮ Unnamed Item ⋮ Optimality of spectral clustering in the Gaussian mixture model ⋮ Solution of Boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation ⋮ Improved row-by-row method for binary quadratic optimization problems ⋮ A New Lower Bound on the Size of the Smallest Vertex Separator of a Graph
This page was built for publication: On the Quality of Spectral Separators
