WikiCards
Play on iPhone nowFree in Safari. Add it to your Home Screen.Play
WikiCards · Card list · Science cards · Maximum flow problem
Uncommon card · Science
Maximum flow problem, an Uncommon card
In optimization theory, maximum flow problems involve finding a feasible flow through a flow network that obtains the maximum possible flow rate.
- Rarity
- Uncommon
- Domain
- Science
- ATK
- 77
- DEF
- 78
- Power
- 155
- Wikipedia reads a year
- 37,000
Power 155 (ATK + DEF): stronger than 80 % of WikiCards cards.
Maximum flow problem quiz: 3 questions
Three questions on the Maximum flow problem card, the way WikiCards duels ask them. Pick an answer, the facts are just below.
Find the missing word
The maximum flow problem can be seen as a special case of more complex network flow problems, such as the ______ problem.
Answer
circulation. The maximum flow problem can be seen as a special case of more complex network flow problems, such as the circulation problem. From the Maximum flow problem article on Wikipedia.
Which of these cards hits hardest (highest ATK)?
Answer
List of awards and nominations received by Dua Lipa. List of awards and nominations received by Dua Lipa 90 · John Tyndall 85 · Maximum flow problem 77 · Binary logarithm 74 ATK in WikiCards.
Which of these Wikipedia articles is read the most in a year?
Answer
Binary relation. Binary relation 47,000 · Maximum flow problem 37,000 · List of awards and nominations received by Dua Lipa 29,000 · Defense Distributed 21,000 Wikipedia reads over a year.
In a duel, each round asks a question like these about the opposing card, with 15 seconds to answer.
The facts on the card
The card carries these facts from its Wikipedia article.
- The maximum flow problem can be seen as a special case of more complex network flow problems, such as the circulation problem.
- The maximum value of an s-t flow is equal to the minimum capacity of an s-t cut in the network, as stated in the max-flow min-cut theorem.
Why it is Uncommon
Rarity in WikiCards follows a year of Wikipedia page views: the most read articles become Epic and Legendary cards. The Maximum flow problem article was read about 37,000 times in a year. ATK comes from the length of the article and DEF from its quality, so this card hits with 77 and blocks with 78: each hit it takes is cut by 31 %.
How to get Maximum flow problem
Open packs. Each pack holds five cards drawn from real Wikipedia articles, the rarest last, and the fifth card is always Rare or better. The odds are shown in the game. A free pack arrives every hour and two can wait, and the Coins you win in duels buy more packs.
More Science cards
Cards close in power
The cards just above and just below Maximum flow problem in the power ranking, all domains together.
- 2013 Chilean general electionUncommon · History · ATK 78 DEF 77
- Peter LekoUncommon · Society · ATK 75 DEF 80
- RaviUncommon · Arts · ATK 83 DEF 72
- Paul DeJongUncommon · Society · ATK 74 DEF 81
- Holy ordersUncommon · Society · ATK 79 DEF 76
- La VentaUncommon · History · ATK 74 DEF 81
Card lists
- Wikipedia quizNew questions every day
- All cards from A to ZEvery card, by name
- Science cards
- Legendary cards
- Tier listS and A tiers by power (ATK + DEF)
Credits
Text : Wikipedia, Maximum flow problem (revision), CC BY-SA 4.0. Photo : George Flonkerton, CC BY-SA 4.0, Wikimedia Commons.
