[jgrapht-users] min vertex cut
Brought to you by:
barak_naveh,
perfecthash
From: Hans-Martin A. <dr...@go...> - 2012-06-12 06:04:11
|
Folks, I am looking for an algorithm for computing the min vertex cut (not the min cut = min edge cut) of an undirected graph. I have been searching the JGraphT documentation in vane. Unless I have overlooked the algorithm (in which case I would appreciate a pointer to where to find it in this library) I propose to add such an algorithm to JGraphT. One of the possibilities would be to transform the original graph into a directed graph with twice the number of nodes and arcs, and then to use a standard min cut algorithmon on the latter. I have seen such an approach described in a book on graph theory, and I could probably retrieve a reference to the book. Regards Hans-Martin Adorf |