[Boost-users] Boost and K-Cuts

Hi all, sorry for my poor english. I want to know if the algorithm explained in this paper:http://www.cc.gatech.edu/~vazirani/k-cut.ps for finding the k-cuts (algorithm efficient) was been development in boost. In other words: There is in BGL some procedure that can cuts minimal a graph? Thanks a lot for the help :) Bye