Back to Results
First PageMeta Content
Theoretical computer science / Maximum flow problem / Flow network / Minimum-cost flow problem / Ford–Fulkerson algorithm / Edmonds–Karp algorithm / Shortest path problem / Matching / Max-flow min-cut theorem / Graph theory / Mathematics / Network flow


Document Date: 2014-12-28 09:03:11

Open Document

File Size: 376,41 KB

Share Result on Facebook

Company

Ford / Maximum-Weight Matchings / Node Supplies / /

IndustryTerm

greedy algorithms / residual network / shortest path algorithm / greedy algorithm / flow network / directed flow network / fat-pipe algorithm / max-flow algorithm / max-flow algorithms / cycle cancelling algorithm / earlier algorithm / derived flow network / http /

Person

Morton Klein / Lunkwill / Bob Tarjan / Andrew Goldberg / Douglas Adams / James Orlin / Jeff Erickson / /

Technology

earlier algorithm / 3 Algorithms / fat-pipe algorithm / so-called cycle cancelling algorithm / augmenting-path algorithm / min-cost max-flow algorithm / max-flow algorithms / all-pairs shortest path algorithm / 8 Algorithms / 2 Algorithms / shortest path algorithm / greedy algorithm / 1 Algorithms / shortest-path algorithm / 7 Algorithms / 5 Algorithms / 6 Algorithms / 4 Algorithms / max-flow algorithms² / max-flow algorithm / /

URL

http /

SocialTag