A conjugate gradient method for the spectral partitioning of graphs

DOI10.1016/S0167-8191(96)00059-2zbMATH Open0906.68104MaRDI QIDQ1392005FDOQ1392005

Authors: N. P. Kruyt 

Publication date: 23 July 1998

Published in: Parallel Computing (Search for Journal in Brave)

Recommendations

• A graph based Davidson algorithm for the graph partitioning problem
• Spectral partitioning with multiple eigenvectors
• Spectral partitioning works: planar graphs and finite element meshes
• An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations

zbMATH Keywords

eigenvalue problemsgraph partitioningconjugate gradient minimizationordering algorithmsspectral bisection

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cited In (5)

• Parallel adaptation of general three-dimensional hybrid meshes
• A partitioning requiring rapidity and quality: the multilevel method and partitions refinement algorithms
• The nonlinear conjugate gradient method for solving a class of the matrix trace minimization problem
• A graph based Davidson algorithm for the graph partitioning problem
• Title not available (Why is that?)

This page was built for publication: A conjugate gradient method for the spectral partitioning of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1392005)