HPC-Netlib

High Performance Math Software


PARTY

Abstract
PARTY uses a combination of local and global graph partitioning algorithms to attempt to find a partition that minimizes the cut size (sum of edge weights incident on different partitions) while keeping the balance of vertex weights among the partitions as low as possible. All partitioning methods implemented in PARTY are capable of handling unequal weights of vertices and edges.
DateOfInformation
Thr Oct 15 16:17:32 1998
Domain
Numerical Programs and Routines!Graph and mesh partitioning
Name
PARTY
TargetEnvironment
Not Available
TitleLine
graph partitioning library
Version
1.1
VersionDate
June 1996
Webpage
http://www.uni-paderborn.de/fachbereich/AG/monien/RESEARCH/PART/party.html
ContactIs
Robert Preis

Meta Data URL from which this entry was created:
http://www.nhse.org/rib/repositories/hpc-netlib/objects/Asset/party.html
hpc-netlib@netlib.org