The Maximum flow problem cardMaximum flow problem

Maximum flow problem

Common

Rarity: Common

The most frequent rarity: most Wikipedia articles become Commons.

Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.

At a glance

Class
Notion
Domain
Science and technology
In collections
Nobody has pulled it yet.

What Wikipedia says

In optimization theory, maximum flow problems involve finding a feasible flow through a flow network that obtains the maximum possible flow rate.

Excerpt from the Wikipedia article “Maximum flow problem”, under the CC BY-SA 4.0 license. Read the article on Wikipedia

Image: Chin Ho Lee, Public domain, via Wikimedia Commons.

Open free boosters and add Maximum flow problem to your collection.

Play for free

Related cards