Partitioning graphs on message-passing machines by pairwise mincut
type: Item
instance of: scholarly article
title: Partitioning graphs on message-passing machines by pairwise mincut
zbMATH Open document ID: 0951.68005
DOI: 10.1016/S0020-0255(98)10005-1
author: J. Ramanujam
author: P. Sadayappan
author: Fikret Erçal
published in: Information Sciences
publication date: 2000-01-04T00:00:00Z
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1384416
zbMATH Keywords: partitioning by pairwise mincut
zbMATH Keywords: massively parallel machines
MaRDI profile type: Publication
cites work: A parallel graph partitioning algorithm for a message-passing multiprocessor
cites work: Parallel Multilevel series k-Way Partitioning Scheme for Irregular Graphs
cites work: A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
cites work: An Efficient Heuristic Procedure for Partitioning Graphs
cites work: Partitioning Sparse Matrices with Eigenvectors of Graphs
cites work: Cluster partitioning approaches to mapping parallel programs onto a hypercube
full work available at URL: s0020-0255(98)10005-1
OpenAlex ID: W1980517755
Recommended article: A Simple Message Passing Algorithm for Graph Partitioning Problems
Recommended article: A parallel graph partitioning algorithm for a message-passing multiprocessor
Recommended article: Min-cut partitioning on underlying tree and graph structures
Recommended article: Q3753826
Recommended article: Q4326917
Recommended article: A Copositive Programming Approach to Graph Partitioning
Recommended article: On Computational Aspects of Greedy Partitioning of Graphs
Recommended article: Partitioning planar graphs: a fast combinatorial approach for max-cut
Recommended article: Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations
Recommended article: Q3575418
description: scientific article; zbMATH DE number 1384416