so I faced this question and I hope that someone can help me in it. Given an undirected graph G = (V, E), 2 vertices x,y and an edge e = (v,u). Suggest an algorithm to find if there's a simple path...

There can be multiple min-cuts in a network. E.g: has four min-cuts and Ford-Fulkerson finds the one "nearer" to s (the source). Can we say the same for all networks? That is, Ford-Fulkerson fin...

Is there a reliable and well-documented Python library with a fast implementation of an algorithm that finds maximum flows and minimum cuts in directed graphs? pygraph.algorithms.minmax.maximum_fl...

I can't understand how to find circulation flow in the network with lower bounds(not demands). I found next documents with problem description and solving strategies: https://www.cs.cmu.edu/~ckin...

I need to find the minimum cut on a graph. I've been reading about flow networks, but all I can find are maximum flow algorithms such as Ford-Fulkerson, push-relabel, etc. Given the max flow-min cu...

A question to the following exercise: Let N = (V,E,c,s,t) be a flow network such that (V,E) is acyclic, and let m = |E|. Describe a polynomial- time algorithm that checks whether N has a unique...

I need to calculate the min-cost-max-flow for a flow network using the boost::successive_shortest_path_nonnegative_weights() function available in the BGL (v 1_60_0). As specified in the documen...

I'm working in medical image segmentation and I want to combine fuzzy connectedness algorithm with the graph cut, the idea is to segment the image with fuzzy connectedness the background and the fo...

I was trying to extract the hair from a given image as described in the research paper, using the concept of energy minimisation, The energy function is dependent on both Prior probability and YCrC...

Given a directed weighted graph, how to find the Maximum Flow ( or Minimum Edge Cut ) between all pairs of vertices. The naive approach is simply to call a Max Flow algorithm like Dinic's, whose co...

Problem: http://www.spoj.com/problems/DIVREL In question, we just need to find the maximum number of elements which are not multiples (a divisible by b form) from a set of elements given. If we ju...

I was reading http://www.geeksforgeeks.org/maximum-bipartite-matching/ and http://en.wikipedia.org/wiki/Ford%E2%80%93Fulkerson_algorithm and am having trouble understanding. It seems the example is...

I've tried to solve a question about the maximum-flow problem. I have one source and two sinks. I need to find a maximum flow in this network. This part is general max-flow. However, both targets h...

opencv has an implementation of max-flow algorithm (class GCGRAPH in file gcgraph.hpp). It's available here. Does anyone know which particular max-flow algorithm is implemented by this class?

Suppose that I've run the Ford-Fulkerson algorithm on a graph G = (V,E) and the result is a max-flow fmax, which is associated to a min-cut Xmin. I'm interested in increasing the flow as much as po...

I'm looking for fast algorithm to compute maximum flow in dynamic graphs (adding/deleting node with related edges to graph). i.e we have maximum flow in G now new node added/deleted with related ed...

I have to write a program which requires to maintain some data in a directed flow graph. I need to compute the maximum-flow at runtime. I know that there exist several libraries for handling graph...