An improved spectral bisection algorithm and its application to dynamic load balancing

DOI10.1016/0167-8191(94)00059-JzbMATH Open0875.68257OpenAlexW2033334321WikidataQ127213017 ScholiaQ127213017MaRDI QIDQ673828FDOQ673828

Authors: R. Van Driessche, Dirk Roose 

Publication date: 28 February 1997

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

Full work available at URL: https://doi.org/10.1016/0167-8191(94)00059-j

Recommendations

• An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
• scientific article; zbMATH DE number 833726
• scientific article; zbMATH DE number 2131658
• HARP: A dynamic spectral partitioner

zbMATH Keywords

Graph partitioningDynamic load balancing(Recursive) spectral bisectionDistributed memory computers

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Theory of operating systems (68N25)

Cited In (12)

• The effectiveness of cyclic blockwise distribution
• Title not available (Why is that?)
• An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
• Parallel static and dynamic multi‐constraint graph partitioning
• Unravelling small world networks
• Consistency of spectral clustering
• Multidimensional partitioning and bi-partitioning: analysis and application to gene expression data sets
• Parallel structures and dynamic load balancing for adaptive finite element computation
• Optimality of spectral clustering in the Gaussian mixture model
• Title not available (Why is that?)
• Spectral clustering and the high-dimensional stochastic blockmodel
• Spectral clustering and its use in bioinformatics

This page was built for publication: An improved spectral bisection algorithm and its application to dynamic load balancing

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