scientific article; zbMATH DE number 910879
From MaRDI portal
zbMATH Open0847.05089MaRDI QIDQ4886053FDOQ4886053
Authors: Stephen Guattery, Gary L. Miller 
Publication date: 28 July 1996
Title of this publication is not available (Why is that?)
Recommendations
eigenvalueseigenvectorsLaplacian matrixgraph algorithmsspectral methodssymmetric matricesgraph separatorsisoperimetric numberspectral separator algorithms
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)
Cited In (20)
- Efficient algorithm for optimizing spectral partitions
- Two improved algorithms for envelope and wavefront reduction
- Spectral partitioning with multiple eigenvectors
- Scalable kernel \(k\)-means clustering with Nyström approximation: relative-error bounds
- Approximating spectral clustering via sampling: a review
- Spectral bisection with two eigenvectors
- New spectral lower bounds on the bisection width of graphs
- Nodal decompositions of graphs
- Geometric Separators for Finite-Element Meshes
- Repeated averages on graphs
- Detection of core-periphery structure in networks using spectral methods and geodesic paths
- Spectral partitioning works: planar graphs and finite element meshes
- A spectral approach to bandwidth and separator problems in graphs
- On spectral bounds for the \(k\)-partitioning of graphs
- Signed graph partitioning by spectral rounding
- Title not available (Why is that?)
- Improvements on spectral bisection
- Title not available (Why is that?)
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- A distributed block Chebyshev-Davidson algorithm for parallel spectral clustering
Uses Software
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4886053)
