Given an undirected graph with vertex weights, there any algorithm for finding the global minimum vertex cut that partitions the graph into two components?

I can transform the graph to directed one and use a repeated edge min-cut algorithm, but is there a better way (something like Karger's algorithm or Stoer-Wagner algorthm)?



Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Browse other questions tagged or ask your own question.