Code for Vertex-Disjoint Menger Problem in NON-planar graphs

1
votes

I am doing an EDA-analysis program. Reading some articles I have found that my problem has a name (Vertex-Disjoint Menger Problem). But all the articles describes algorithms for planar graphs - needless to say that I have non-planar undirected graphs.

This problem is equivalent to finding the minimum s-t vertex cut in a undirected graph.

Also, instead of high-level algorithmic descriptions, I would like functional C/C++ code. As far as I can tell, BOOST has no such functionality.

1
graphgraph-theory

1 Answers

1
votes

As mentioned in another question, finding the minimum s–t vertex cut in a undirected graph can be reduced to finding the minimum s–t edge cut in a directed graph, for which many algorithms and implementations exist.