User Portlet

Kiril Dan

Discussions

Find a minimum source-destination min cut in a graph? I have implemented the s-t min-cut in a directed graph(using the explanation from this [site][1]). The code is below Graph creation: checkGrap = Graph[{1 \[DirectedEdge] 2, 1 \[DirectedEdge] 3, 3 \[DirectedEdge] 1, 2... AUTHOR: Kiril Dan 4445VIEWS 1REPLIES BY: Kiril Dan 6 years ago
Functions or packages to implement Belief propagation? I look for an efficient way to implement a [Belief Propagation][1] (more specific, parallel implementation). Does anyone know about any useful functions or packages? [1]: https://en.wikipedia.org/wiki/Belief_propagation AUTHOR: Kiril Dan 2479VIEWS 0REPLIES 6 years ago