I am trying to follow this paper . There is a relationship between Markov Random Fields (MRF) to max-flow-min-cut. An MRF can be represented as an undirected graph, and you can find flow through it, but what extra special properties do you get if you know the graph is Markovian? What is the point of putting these two ideas together?
- Kwatra, Vivek, et al. "Graphcut textures: image and video synthesis using graph cuts." ACM Transactions on Graphics (ToG). Vol. 22. No. 3. ACM, 2003.