Give an example of a directed graph with real numbers for edge capacities (as opposed to integer numbers) where the Ford-Fulkerson algorithm may not terminate. Explain the reason why the algorithm may not terminate.
Posted: Jun 08 '12
Seen: 91 times
Last updated: Oct 19 '12
Counting intersections of chords
Randomly built binary search tree
Minimum Flip Connectivity Problem
Fixed-parameter tractability of Vertex Cover