<p>Feel free to choose any method to calculate mincuts computationally from graphs. I list below a simple example, relevant research, models, storage methods, lemmas, theorems -- and something about visualisation and computing on which this thread is focused on. Next step after the simple example is the parametrisation of the graphical model and then computation. </p>

<p><strong>Simple example with Python and <a href="https://stackoverflow.com/questions/533905/get-the-cartesian-product-of-a-series-of-lists-in-python">Cartesian product</a></strong></p>

<p>Assume a 3x2x2 graph with 3 parallel where 1st branch with 3 things, 2nd branch with 2 things and last branch 2 things. The minimum cuts are <em>{{1,4,6},{1,4,7},{1,5,6},{1,5,7},{2,4,6},{2,4,7},{2,5,6},{2,5,7},{3,4,6},{3,4,7},{3,5,6},{3,5,7}}</em>. </p>

<p><a href="https://i.stack.imgur.com/dCqMa.jpg" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/dCqMa.jpg" alt="enter image description here"></a></p>

<pre><code>import itertools;

somelists = [
   [1, 2, 3],
   [4, 5],
   [6, 7]
]

print list(itertools.product(*somelists))
</code></pre>

<p><strong>Computing</strong></p>

<ul>
<li><p>General question <a href="https://stackoverflow.com/questions/31734234/how-to-analyse-a-sparse-adjacency-matrix">How to analyse a sparse adjacency matrix?</a> but relevant because graphs often are sparse.</p></li>
<li><p>Graph Complement useful in finding mincuts: a trial with Mathematica below but notice that <a href="https://mathematica.stackexchange.com/a/105403/2000">some bugs</a> in Mathematica found in at least 10.1 related to mincut and VertexConnectivity commands. </p></li>
</ul>

<p><strong>Mathematics</strong></p>

<ul>
<li><p><em>[Graphical parametrization problem in computational algebra for cuts]</em> Cut ideals such as <a href="http://arxiv.org/abs/1209.6372" rel="nofollow noreferrer">Betti numbers of cut ideals of trees</a></p></li>
<li><p><em>[Hard graphical parametrization problem of simple graphs]</em> <a href="https://math.stackexchange.com/questions/1657294/smallest-generating-set-of-simple-graphs-for-fixed-number-of-vertices-and-fixed">Smallest generating set of simple graphs for fixed number of vertices and fixed number of vertex cuts?</a></p></li>
<li><p>The mincuts have crossing criteria, <a href="https://www.cs.elte.hu/egres/qp/egresqp-09-03.pdf" rel="nofollow noreferrer">cactus storage method</a> and the current research outlined in the <a href="https://www.informatik.uni-augsburg.de/thi/personen/kammer/Graph_Connectivity.pdf" rel="nofollow noreferrer">Graph Connectivity paper (2004)</a>.</p></li>
<li><p>Many relevant terms for minimum cuts such as vertex separators, bifurcators, vertex cuts, edge cuts, graph boundaries -- mathematical terms outlined <a href="https://math.stackexchange.com/questions/1600059/set-of-the-vertex-sets-to-make-connected-graph-into-disjoint-sets-of-vertices">here</a>. </p></li>
</ul>

<p><strong>Visualising series-parallel graphs with sink and source</strong></p>

<ul>
<li><p><a href="https://tex.stackexchange.com/questions/290467/tikz-package-to-draw-series-parallel-graphs-with-many-vars-in-series-parallel">Tikz package to draw series parallel graphs with many vars in series parallel</a></p></li>
<li><p>Quality material contain <em>"Graphical models"</em> by Lauritzen Steffen, <em>"Graphical models for R"</em> and Algebraic geometric material by Sturmfels.</p></li>
</ul>
Mincuts from graphs to find permutations that break the system into disjoint sets?
<p>Assume an undirected system, graph where you want to find out elements in their permutations that makes the system disjoint such that each set is minimum. This graph has two special nodes: sink and source that cannot be in the elements.</p>

<p><em>How can you computationally find the minimum cuts given some graph G=(V,E)?</em></p>