Partitioning graphs on message-passing machines by pairwise mincut

DOI10.1016/S0020-0255(98)10005-1zbMath0951.68005OpenAlexW1980517755MaRDI QIDQ1818794

J. Ramanujam, Fikret Erçal, Ponnuswamy Sadayappan

Publication date: 4 January 2000

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0255(98)10005-1

zbMATH Keywords

massively parallel machinespartitioning by pairwise mincut

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Hypercube embedding heuristics: An evaluation

Cites Work

• A parallel graph partitioning algorithm for a message-passing multiprocessor
• Cluster partitioning approaches to mapping parallel programs onto a hypercube
• Partitioning Sparse Matrices with Eigenvectors of Graphs
• An Efficient Heuristic Procedure for Partitioning Graphs
• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
• Parallel Multilevel series k-Way Partitioning Scheme for Irregular Graphs

This page was built for publication: Partitioning graphs on message-passing machines by pairwise mincut