Lesson plan

Dinic's algorithm

Dinic's algorithm or Dinitz's algorithm is a strongly polynomial algorithm for computing the maximum flow in a flow network, conceived in 1970 by Israeli (formerly Soviet) computer scientist Yefim Dinitz. The algorithm runs in O(|V|^2|E|) time and is similar to the Edmonds–Karp algorithm, which runs in O(|V||E|^2) time, in that it uses shortest augmenting paths. The introduction of the concepts of the level graph and blocking flow enable Dinic's algorithm to achieve its performance.

Back to article

Article summary

Dinic's algorithm or Dinitz's algorithm is a strongly polynomial algorithm for computing the maximum flow in a flow network, conceived in 1970 by Israeli (formerly Soviet) computer scientist Yefim Dinitz. The algorithm runs in O(|V|^2|E|) time and is similar to the Edmonds–Karp algorithm, which runs in O(|V||E|^2) time, in that it uses shortest augmenting paths. The introduction of the concepts of the level graph and blocking flow enable Dinic's algorithm to achieve its performance.

Key claims

  1. publication date: 1972 — source: Wikipedia, revision 1374875607, retrieved 2026-10-20 · confidence 0.95

Discussion questions

  1. Summarise the article in your own words. Which single claim would you verify first, and why?
  2. The record states that the publication date is "1972". What evidence would count against this claim?
  3. Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
  4. If two sources disagreed about one of these facts, what would you need in order to trust one over the other?

Bibliography

  1. Wikipedia, “Dinic's algorithm”, revision 1374875607, retrieved 2026-10-20 https://en.wikipedia.org/w/index.php?oldid=1374875607

Key claims and bibliography are generated from the same tracked claims and sources as the article page.