A
Projection Technique for Graph Bisection
is a Fortran program that finds both a good equipartition of
a given graph and a bound of the optimum value of this partition.
This is based on a
computational based research
report (abstract)
published in
Mathematical Programming, 1994.
A
gzipped tar file with MATLAB programs that solve the AC problem
is also
available in
this directory.
In particular, the file dualcomp.m
is a self-documented MATLAB file that solves the large
sparse approximate completion problem in the case that there are many
elements free.