Stack Overflow
Stack Overflow

Questions tagged [max-flow]

The maximum-flow problem, a problem in computer science over a flow network

The maximum flow (max-flow) problem is a problem in computer science, studied in the theory of s, involving finding the maximum flow over a given flow network. It is closely related to the problem for graphs.

214 questions
4
votes
1 answer

Change in Max Flow if every edge capacity is increased

I need to find a linear algorithm (O(|V| + |E|) that would find the max flow on a graph where original max flow is known but the capacity of each edge is increased by 1.
user1255841
  • 61
  • 1
  • 3
3
votes
1 answer

Boost max flow algorithms do not compile. error: forming reference to void

Boost provides three different algorithms for finding max flow in directed graphs: boykov_kolmogorov, edmonds_karp and push_relabel. All of them have named and non-named parameter versions. Parameter sets they use are also very similar. Despite…
Nikita Rudenko
  • 55
  • 1
  • 5
3
votes
2 answers

Max flow: how to force f units to flow, with minimal changes to capacity?

Let's say I have a graph and run a max-flow on it. I get some flow, f. However, I want to to flow f1 units where f1>f. Of course, I need to go about increasing some of the edge capacities. I want to make as small a total increase as possible to the…
Rohit Pandey
  • 2,443
  • 7
  • 31
  • 54
3
votes
0 answers

Pymaxflow installation on Mac

I was trying to install the newest version of Pymaxflow through git. When I downloaded the source code and ran python setup.py build it reports an error: maxflow/src/_maxflow.cpp:610:10: fatal error: 'ios' file not found #include "ios" ^~~~~ 2…
Guojun Zhang
  • 111
  • 1
  • 9
3
votes
2 answers

Max flow algorithm running time

I have the following two questions. True or false: We can always find a sequence of flow augmenting s-t paths in the Ford-Fulkerson algorithm such that we reach the maximum flow in a polynomial number of iterations. True or false: We can always…
arkham knight
  • 373
  • 7
  • 18
3
votes
2 answers

Find m elements in n arrays by picking at most 1 element out of each of the n arrays

I have n arrays, each of them contain an arbitrary amount of integers. No duplicates are possible within an array ([1,1,2] can't be one of the n arrays). I also have an integer array of size m which is filled with integers from 1 to m…
PlsWork
  • 1,958
  • 1
  • 19
  • 31
3
votes
1 answer

How to show that union and intersection of min cuts in flow network is also a min cut

The proof of this is everywhere skipped and said to be corollary of Min-Cut-Max-Flow theorem ... It's usually something like: Let S1 and S2 be minimum cuts of a flow network. Then S1∪S1 and S1∩S2 are also min cuts. Can anyone tell me how exactly…
wannabe programmer
  • 653
  • 1
  • 9
  • 23
3
votes
2 answers

What is node-disjoint paths?

I need explanation about what exactly node-disjoint paths? and How to determine maximum number of node-disjoint path between two nodes Source(s) and Sink(t) in a directed graph. Can anyone explain with graphically.
Praveenkumar Beedanal
  • 774
  • 11
  • 20
3
votes
3 answers

How to apply Ford-Fulkerson algorithm to a graph to find maximum flow in a flow network?

Can someone please direct me to a site where step-by-step instruction is given on how to apply ford-fulkerson method on a graph to find the maximum flow. Thank you so much in advance.
sap
  • 1,141
  • 6
  • 41
  • 62
3
votes
2 answers

Greedy Maximum Flow

The Dining Problem: Several families go out to dinner together. In order to increase their social interaction, they would like to sit at tables so that no two members of the same family are at the same table. Assume that the dinner contingent has p…
Manuel
  • 247
  • 2
  • 3
  • 14
3
votes
1 answer

Finding the lowest amount of edges in all minimum cuts in flow network

Given a network N, I want to find the minimum cut that has the lowest number of edges in it. I thought about: Find the maximum flow (with Dinitz algorithm for example) Increase the capacity function such that for every edge e c'(e)=c(e)+1, then use…
Yinon Eliraz
  • 317
  • 1
  • 6
  • 22
3
votes
1 answer

K edge disjoint paths in a directed graph

Give two vertices u and v in G = (V,E) and a positive integer k, describe an algorithm to decide if there exists a k edge disjoint paths from u to v. If the answer to the decision problem is yes, describe how to compute a set of k edge disjoint…
Ankit Mishra
  • 409
  • 2
  • 5
  • 17
3
votes
2 answers

linear solution of grid constraints

You have a grid n x n with n rows and n columns. For every column j you are given a number Cj and for every row i you are given a number Ri. You need to mark some points on the grid, in this way: the number of marked points in every row is at most…
lorenzo188
  • 31
  • 3
3
votes
0 answers

Successive Shortest Paths vs Ford–Fulkerson

Can someone explain how exactly Successive Shortest Paths (SSP) is a generalization of the Ford–Fulkerson algorithm? I've found this stated in a few papers and websites as well as the Wikipedia page for the Minimum-cost flow problem. But none of…
thad
  • 167
  • 1
  • 4
  • 16
3
votes
1 answer

Using Named parameters and Bundled properties with edmonds_karp_max_flow()

I am trying to use Named parameters with Bundled properties in the edmonds_karp_max_flow algorithm of the Boost-graph library. To show my problem, I took the existing edmonds-karp example and turned the Internal properties into Bundled properties (I…
maelvls
  • 78
  • 12
1 2
3
…
14 15