Contents of this Asset file:
| Field Name | Value | HTML Tag Type |
|---|---|---|
| BIDM.Asset.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. | META |
| BIDM.Asset.ContactIs.Organization | http://www.nhse.org/rib/repositories/hpc-netlib/objects/Organization/robert_preis.html | LINK |
| BIDM.Asset.DateOfInformation | Thr Oct 15 16:17:32 1998 | META |
| BIDM.Asset.Domain | Numerical Programs and Routines!Graph and mesh partitioning | META |
| BIDM.Asset.Name | PARTY | META |
| BIDM.Asset.RecordMaintainedBy.Organization | http://www.nhse.org/rib/repositories/hpc-netlib/objects/Organization/hpc-netlib.html | LINK |
| BIDM.Asset.TargetEnvironment | Not Available | META |
| BIDM.Asset.TitleLine | graph partitioning library | META |
| BIDM.Asset.Version | 1.1 | META |
| BIDM.Asset.VersionDate | June 1996 | META |
| BIDM.Asset.Webpage | http://www.uni-paderborn.de/fachbereich/AG/monien/RESEARCH/PART/party.html | META |