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 (Chaim) A. Dinitz. ^[1] The algorithm runs in ${\displaystyle O(|V|^{2}|E|)}$ time and is similar to the Edmonds–Karp algorithm, which runs in ${\displaystyle 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.

History

Dinitz invented the algorithm in January 1969, as a master's student in Georgy Adelson-Velsky's group. A few decades later, he would recall: ^[2]

In Adel'son-Vel'sky's Algorithms class, the lecturer had a habit of giving the problem to be discussed at the next meeting as an exercise to students. The DA was invented in response to such an exercise. At that time, the author was not aware of the basic facts regarding [the Ford–Fulkerson algorithm]….

⋮

Ignorance sometimes has its merits. Very probably, DA would not have been invented then, if the idea of possible saturated edge desaturation had been known to the author.

In 1970, Dinitz published a description of the algorithm in Doklady Akademii Nauk SSSR. In 1974, Shimon Even and (his then Ph.D. student) Alon Itai at the Technion in Haifa were very curious and intrigued by Dinitz's algorithm as well as Alexander V. Karzanov's related idea of blocking flow. However it was hard for them to decipher these two papers, each being limited to four pages to meet the restrictions of journal Doklady Akademii Nauk SSSR. Even did not give up, and after three days of effort managed to understand both papers except for the layered network maintenance issue. Over the next couple of years, Even gave lectures on "Dinic's algorithm", mispronouncing the name of the author while popularizing it. Even and Itai also contributed to this algorithm by combining BFS and DFS, which is how the algorithm is now commonly presented. ^[2]

For about 10 years of time after the Ford–Fulkerson algorithm was invented, it was unknown if it could be made to terminate in polynomial time in the general case of irrational edge capacities. This caused a lack of any known polynomial-time algorithm to solve the max flow problem in generic cases. Dinitz's algorithm and the Edmonds–Karp algorithm (published in 1972) both independently showed that in the Ford–Fulkerson algorithm, if each augmenting path is the shortest one, then the length of the augmenting paths is non-decreasing and the algorithm always terminates.

Definition

Let ${\displaystyle G=((V,E),c,f,s,t)}$ be a network with ${\displaystyle c(u,v)}$ and ${\displaystyle f(u,v)}$ the capacity and the flow of the edge ${\displaystyle (u,v)}$, respectively.

The residual capacity is a mapping ${\displaystyle c_{f}\colon V\times V\to R^{+}}$ defined as,

1. if ${\displaystyle (u,v)\in E}$,

   ${\displaystyle c_{f}(u,v)=c(u,v)-f(u,v)}$

2. if ${\displaystyle (v,u)\in E}$,

   ${\displaystyle c_{f}(u,v)=f(v,u)}$

3. ${\displaystyle c_{f}(u,v)=0}$ otherwise.

The residual graph is an unweighted graph ${\displaystyle G_{f}=((V,E_{f}),c_{f}|_{E_{f}},s,t)}$, where

${\displaystyle E_{f}=\{(u,v)\in V\times V\colon \;c_{f}(u,v)>0\}}$.

An augmenting path is an ${\displaystyle s}$–${\displaystyle t}$ path in the residual graph ${\displaystyle G_{f}}$.

Define ${\displaystyle \operatorname {dist} (v)}$ to be the length of the shortest path from ${\displaystyle s}$ to ${\displaystyle v}$ in ${\displaystyle G_{f}}$. Then the level graph of ${\displaystyle G_{f}}$ is the graph ${\displaystyle G_{L}=((V,E_{L}),c_{f}|_{E_{L}},s,t)}$, where

${\displaystyle E_{L}=\{(u,v)\in E_{f}\colon \;\operatorname {dist} (v)=\operatorname {dist} (u)+1\}}$.

A blocking flow is an ${\displaystyle s}$–${\displaystyle t}$ flow ${\displaystyle f'}$ such that the graph ${\displaystyle G'=((V,E_{L}'),s,t)}$ with ${\displaystyle E_{L}'=\{(u,v)\colon \;f'(u,v)<c_{f}|_{E_{L}}(u,v)\}}$ contains no ${\displaystyle s}$–${\displaystyle t}$ path. ^{[Note 1] [3]}

Algorithm

Dinic's Algorithm

Input: A network ${\displaystyle G=((V,E),c,s,t)}$.

Output: An ${\displaystyle s}$–${\displaystyle t}$ flow ${\displaystyle f}$ of maximum value.

1. Set ${\displaystyle f(e)=0}$ for each ${\displaystyle e\in E}$.
2. Construct ${\displaystyle G_{L}}$ from ${\displaystyle G_{f}}$ of ${\displaystyle G}$. If ${\displaystyle \operatorname {dist} (t)=\infty }$, stop and output ${\displaystyle f}$.
3. Find a blocking flow ${\displaystyle f'}$ in ${\displaystyle G_{L}}$.
4. Add augment flow ${\displaystyle f}$ by ${\displaystyle f'}$ and go back to step 2.

Analysis

It can be shown that the number of layers in each blocking flow increases by at least 1 each time and thus there are at most ${\displaystyle |V|-1}$ blocking flows in the algorithm. For each of them:

• the level graph ${\displaystyle G_{L}}$ can be constructed by breadth-first search in ${\displaystyle O(E)}$ time
• a blocking flow in the level graph ${\displaystyle G_{L}}$ can be found in ${\displaystyle O(VE)}$ time ^{[Note 2]}

with total running time ${\displaystyle O(E+VE)=O(VE)}$ for each layer. As a consequence, the running time of Dinic's algorithm is ${\displaystyle O(V^{2}E)}$. ^[2]

Using a data structure called dynamic trees, the running time of finding a blocking flow in each phase can be reduced to ${\displaystyle O(E\log V)}$ and therefore the running time of Dinic's algorithm can be improved to ${\displaystyle O(VE\log V)}$.

Special cases

In networks with unit capacities, a much stronger time bound holds. Each blocking flow can be found in ${\displaystyle O(E)}$ time, and it can be shown that the number of phases does not exceed ${\displaystyle O({\sqrt {E}})}$ and ${\displaystyle O(V^{2/3})}$. ^{[Note 3]} Thus the algorithm runs in ${\displaystyle O(\min\{V^{2/3},E^{1/2}\}E)}$ time. ^[4]

In networks that arise from the bipartite matching problem, the number of phases is bounded by ${\displaystyle O({\sqrt {V}})}$, therefore leading to the ${\displaystyle O({\sqrt {V}}E)}$ time bound. The resulting algorithm is also known as Hopcroft–Karp algorithm. More generally, this bound holds for any unit network — a network in which each vertex, except for source and sink, either has a single entering edge of capacity one, or a single outgoing edge of capacity one, and all other capacities are arbitrary integers. ^[3]

Example

The following is a simulation of Dinic's algorithm. In the level graph ${\displaystyle G_{L}}$, the vertices with labels in red are the values ${\displaystyle \operatorname {dist} (v)}$. The paths in blue form a blocking flow.

	${\displaystyle G}$	${\displaystyle G_{f}}$	${\displaystyle G_{L}}$
1.
	The blocking flow consists of ${\displaystyle \{s,1,3,t\}}$ with 4 units of flow, ${\displaystyle \{s,1,4,t\}}$ with 6 units of flow, and ${\displaystyle \{s,2,4,t\}}$ with 4 units of flow. Therefore, the blocking flow is of 14 units and the value of flow ${\displaystyle |f|}$ is 14. Note that each augmenting path in the blocking flow has 3 edges.
2.
	The blocking flow consists of ${\displaystyle \{s,2,4,3,t\}}$ with 5 units of flow. Therefore, the blocking flow is of 5 units and the value of flow ${\displaystyle |f|}$ is 14 + 5 = 19. Note that each augmenting path has 4 edges.
3.
	Since ${\displaystyle t}$ cannot be reached in ${\displaystyle G_{f}}$, the algorithm terminates and returns a flow with maximum value of 19. Note that in each blocking flow, the number of edges in the augmenting path increases by at least 1.

See also

• Ford–Fulkerson algorithm
• Maximum flow problem

Notes

1. This means that the subgraph resulting from removing all saturated edges (edges ${\displaystyle (u,v)}$ with ${\displaystyle f'(u,v)=c_{f}|_{E_{L}}(u,v)}$) does not contain any path from ${\displaystyle s}$ to ${\displaystyle t}$. In other terms, the blocking flow is such that every possible path from ${\displaystyle s}$ to ${\displaystyle t}$ contains a saturated edge.
2. Finding the blocking flow can be implemented in ${\displaystyle O(E)}$ per path via a sequence of Advance and Retreat operations. See http://courses.csail.mit.edu/6.854/06/scribe/scribe11.pdf for more details.
3. The ${\displaystyle O(V^{2/3})}$ bound assumes that no two edges connect the same pair of vertices in the same direction, while the ${\displaystyle O({\sqrt {E}})}$ bound makes no such assumption.

1. E. A. Dinic (1970). "Algorithm for solution of a problem of maximum flow in a network with power estimation" (PDF). Doklady Akademii Nauk SSSR. 11: 1277–1280.
2. Dinitz, Yefim (2006). "Dinitz' Algorithm: The Original Version and Even's Version". In Oded Goldreich; Arnold L. Rosenberg; Alan L. Selman (eds.). Theoretical Computer Science: Essays in Memory of Shimon Even . Springer. pp. 218–240. ISBN   978-3-540-32880-3.
3. Tarjan 1983, p. 102.
4. Even, Shimon; Tarjan, R. Endre (1975). "Network Flow and Testing Graph Connectivity". SIAM Journal on Computing. 4 (4): 507–518. doi:10.1137/0204043. ISSN   0097-5397.

References

• Dinitz, Yefim (2006). "Dinitz' Algorithm: The Original Version and Even's Version". In Oded Goldreich; Arnold L. Rosenberg; Alan L. Selman (eds.). Theoretical Computer Science: Essays in Memory of Shimon Even . Springer. pp. 218–240. ISBN   978-3-540-32880-3.
• Kadar, Ilan; Albagli, Sivan (18 April 2019). Dinitz's algorithm for finding a maximum flow in a network. Ben-Gurion University. Archived from the original on 22 December 2023.
• Korte, B. H.; Vygen, Jens (2008). "8.4 Blocking Flows and Fujishige's Algorithm". Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics, 21). Springer Berlin Heidelberg. pp. 174–176. ISBN   978-3-540-71844-4.
• Tarjan, R. E. (1983). Data structures and network algorithms.