Spectral bisection of graphs and connectedness
From MaRDI portal
Publication:2447954
DOI10.1016/j.laa.2014.02.007zbMath1286.05101OpenAlexW2050730826MaRDI QIDQ2447954
John C. Urschel, Ludmil T. Zikatanov
Publication date: 29 April 2014
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2014.02.007
Related Items (6)
On the maximal error of spectral approximation of graph bisection ⋮ Topological melting in networks of granular materials ⋮ Nodal decompositions of graphs ⋮ Effective Resistance Preserving Directed Graph Symmetrization ⋮ Invertibility of graph translation and support of Laplacian Fiedler vectors ⋮ Fiedler vectors with unbalanced sign patterns
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graph partitioning by eigenvectors
- A note on Laplacian graph eigenvalues
- Volume of an N-simplex by multiple integration
- Laplacian graph eigenvectors
- Laplacian matrices of graphs: A survey
- Interlacing eigenvalues and graphs
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- Eigenvectors of acyclic matrices
- Parallel Multilevel series k-Way Partitioning Scheme for Irregular Graphs
- On the Optimality of the Median Cut Spectral Bisection Graph Partitioning Method
This page was built for publication: Spectral bisection of graphs and connectedness
