Exercises
Multiple Choice
Articles
Open Problems
Login
2 items
Tagged:
max flow
x
Start over
- to expand, or dig in by adding more tags and revising the query.
Sort By:
trending ▼
date
0
Undergraduate
By
Shiva Kintali
on June 9, 2012 | Updated Dec. 6, 2017
Termination of Ford-Fulkerson algorithm
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…
Computer Science
Algorithms
max flow
0
Undergraduate
By
Shiva Kintali
on Oct. 19, 2012 | Updated Dec. 6, 2017
Minimum Path Cover
A path cover of a directed graph \(G(V,E)\) is a set \(P\) of vertex-disjoint paths such that every vertex in \(V\) is included in exactly one path in \(P\). Paths may start and end anywhere, and they…
Computer Science
Algorithms
max flow
icon
Sign In or Sign Up
icon
Invite Friends
Post Something
x
Select What You'd Like To Post
POST AN ARTICLE
POST AN OPEN PROBLEM
POST AN EXERCISE
POST A MULTIPLE-CHOICE QUESTION
Content Types
Articles
Open Problems
Exercises
Multiple-Choice Questions
Levels
High school
Undergraduate
Graduate
Subjects
Mathematics
Computer Science
Puzzles
Optimization
Trending tags
edge coloring
graph coloring
interview question
probability
pigeonhole principle
basics
connectivity
integration
jee
jee 2016
Topics
Algebra
Algorithms
Approximation Algorithms
Calculus
Combinatorial Optimization
Combinatorics
Complexity Theory
Data Structures
Discrete Mathematics
Game Theory
Geometry
Graph Theory
Linear Algebra
Linear Programming
Logic
Mathematical Analysis
Mathematics
Matrix Theory
Number Theory
Optimization
Probability
Programming
Puzzles
Randomized Algorithms
Real Analysis
Trigonometry
×