maximizing cut

Hey there

I'm interested in partitioning a graph so that I maximize the cut between partitions (or equivalently minimize the internal cost). Do you know how I can do this relatively easily with Metis? I guess it would involve modifying the code to allow for negative edge weights, or modifying the cost function...? Or alternatively, do you know of a graph partitioning package which would be better suited for my purposes?


- Tim