# Questions tagged [network-flow]

For questions about networks that inhibit source and sink nodes and a notion of flow.

389 questions
Filter by
Sorted by
Tagged with
22 views

### Is a network flow equivalent to a walk?

Consider a directed graph where each edge has infinite capacity. Now consider a directed walk on this graph from arbirtary node s to arbitrary node t with $s \neq t$. Definition (Directed walk): A ...
• 21
17 views

### Network Flows - a cut

A really simple question that I cannot find a direct answer to. I guess it's considered so obvious but when finding a cut on a network flow graph (not necessarily min) can it cut an arc twice? TY
• 21
16 views

### Transforming LPP into transportation matrix

I need to transform an LPP into a transportation matrix, however, where I would expect greater than' for constraints on demand, the LPP only has 'less-than' constraints. Any hints on transforming this ...
• 55
1 vote
31 views

### Comparing network graphs

I started out with a grid graph, performed some operations on it, and ended up with a set of networks; for example, , , , I need to compare these graphs. A thought that I had was to compare them with ...
• 338
30 views

### Comparing networks using graph theory

I'm new to graph theory so forgive if I use unconventional terminology. Please ask if there's any confusion regarding the statements I make. I have a bunch of undirected, unweighted, simple graphs ...
• 338
1 vote
44 views

• 404
72 views

• 6,068
84 views

### prove the flow $f(χ)$ across any cut is equal to the flow value of the network $|f|$

I have one question please about proving that the flow $f(χ)$ across any cut is equal to the flow value of the network $|f|$. Now, the flow of the cut is the difference between flow of forward edges (...
• 1,103
1 vote
I'm having trouble solving following integer programming using python. Let $G$ be a graph with nodes set $V=\{0,1,...,|V|-1\}$ and edges set $E$. Define cost of each edge $(m,n)$ as $c_{m,n}$ set ...