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
Mathematical Programming, 1994.
theoretical paper, published in Annals of Operations Research,
is also available.
semidefinite programming relaxation paper (abstract)
presents improved bounds.
University of Waterloo
200 University Avenue West
Waterloo, Ontario, Canada N2L 3G1
519 888 4567
contact us |
No scripting available, tracking aborted.