PARTY PARTY, a graph partitioning library, 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. It has been reported to work on Linux with minor modification, according to the author.

Current Version:   1.1 License Type:   Free

Home Site: http://www.uni-paderborn.de/fachbereich/AG/monien/RESEARCH/PART/party.html Source Code Availability: Yes with registration (see Home Site) Available Binary Packages: Debian Package: No RedHat RPM Package: No Other Packages: No Targeted Platforms: Unix Software/Hardware Requirements: None

Other Links: None Mailing Lists/USENET News Groups: None User Comments: None See A Screen Shot? (Not Yet)

  SAL Home   |   Numerical Analysis   |   Discrete Methods & Related Tools