Dinic's Algorithm
Dinic's Algorithm is a polynomial-time algorithm for computing maximum flow in a flow network, distinguished by its use of layered networks and blocking flows to achieve improved time complexity over simple augmenting path methods.
12
Publications
924
Citations
19
Authors
11
Institutions
Publications per year
2017–2026
0
Variants
Dinic AlgorithmDinitz's Algorithm
Parents
12
Network Flow and Testing Graph Connectivity
Shimon Even, Robert E. Tarjan · SIAM Journal on Computing · 1975 · 558 citations
Bottlenecks and Edge Connectivity in Unsymmetrical Networks
C. P. Schnorr · SIAM Journal on Computing · 1979 · 40 citations
Robert E. Tarjan · 1974 · 32 citations · Full text
1–5 of 12
19
2
h-index
2
h-index
1
h-index
1
h-index
1
h-index
1–5 of 19
11
The University of Tokyo
Tokyo, Japan
2 h-index
2 publications
45 citations
University of Augsburg
Augsburg, Germany
2 h-index
4 publications
76 citations
University of California, Davis
Davis, United States
1 h-index
1 publications
11 citations
Chuo University
Hachiōji, Japan
1 h-index
1 publications
20 citations
University of Bayreuth
Bayreuth, Germany
1 h-index
2 publications
148 citations
University of California, Berkeley
Berkeley, United States
1 h-index
1 publications
32 citations
Rutgers, The State University of New Jersey
New Brunswick, United States
1 h-index
1 publications
90 citations
Berkeley College
New York, United States
1 h-index
1 publications
32 citations
1–8 of 11
3 publications · 49 citations
3
h-index
2 publications · 45 citations
2
h-index
2 publications · 598 citations
2
h-index
1 publications · 18 citations
1
h-index
1 publications · 74 citations
1
h-index
1–5