ColPack
ColPack is a software package consisting of sequential algorithms for a variety of graph
coloring and related problems in sparse derivative matrix computation. It is written in C++ heavily using
the STL. Its first version is released in Sept 2008. Implementations of parallel algorithms for some of the
coloring problems in ColPack are available in Zoltan. MatchBox
MatchBox is a C++ software package consisting of sequential exact as well as approximation
algorithms for a variety of graph matching problems. The package is currently under development. A trial
copy can be obtained by request from apothen at purdue dot edu or Mahantesh dot Halappanavar at pnnl dot gov. MatchBoxP
MatchBoxP is a software package currently being written. It will consist of parallel
approximation algorithms for various matching problems implemented in C++ and using MPI. OBLIO
An algorithmic laboratory for solving spase symmetric (indefinite and positive definite) systems of linear equations by factorization. EUCLID
C and MPI software for incomplete factor (ILU and IC) preconditioners on parallel computers. FastSloan
C software for computing orderings for the sequencing problem. Spindle
An object-oriented algorithmic laboratory that implements in C++ most of the modern variants
of greedy fill-reducing orderings (The Multiple Minimum Degree (MMD) and Approximate Minimum Degree (AMD)
algorithms and their cousins). A better-documented version will be released shortly.
