scientific article; zbMATH DE number 910879
From MaRDI portal
Recommendations
Cited in
(20)- Improvements on spectral bisection
- A spectral approach to bandwidth and separator problems in graphs
- Spectral partitioning with multiple eigenvectors
- Geometric Separators for Finite-Element Meshes
- Spectral bisection with two eigenvectors
- Repeated averages on graphs
- Two improved algorithms for envelope and wavefront reduction
- On spectral bounds for the \(k\)-partitioning of graphs
- Scalable kernel \(k\)-means clustering with Nyström approximation: relative-error bounds
- Signed graph partitioning by spectral rounding
- scientific article; zbMATH DE number 6276186 (Why is no real title available?)
- Efficient algorithm for optimizing spectral partitions
- Spectral partitioning works: planar graphs and finite element meshes
- Approximating spectral clustering via sampling: a review
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- Nodal decompositions of graphs
- Detection of core-periphery structure in networks using spectral methods and geodesic paths
- scientific article; zbMATH DE number 7626762 (Why is no real title available?)
- New spectral lower bounds on the bisection width of graphs
- A distributed block Chebyshev-Davidson algorithm for parallel spectral clustering
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)