Spectral bisection with two eigenvectors

DOI10.1016/j.endm.2017.07.067zbMath1378.05173OpenAlexW2742228070MaRDI QIDQ1690049

Israel Rocha

Publication date: 18 January 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2017.07.067

zbMATH Keywords

graph partitioningLaplacian matrixFiedler vector

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Optimal grid drawings of complete multipartite graphs and an integer variant of the algebraic connectivity

Cites Work

• Unnamed Item
• Spectral partitioning works: planar graphs and finite element meshes
• Finding good approximate vertex and edge partitions is NP-hard
• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
• On the Quality of Spectral Separators
• An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
• Improvements on Spectral Bisection
• Lower Bounds for the Partitioning of Graphs

This page was built for publication: Spectral bisection with two eigenvectors