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

Authors

19

  1. DJ
    Dieter Jungnickel

    Justus-Liebig-Universität Gießen, Germany

    2 publications · 38 citations

    2

    h-index

  2. RE
    Robert E. Tarjan

    Princeton University, United States

    2 publications · 590 citations

    2

    h-index

  3. CF
    Christian Fremuth‐Paeger

    University of Augsburg, Germany

    1 publications · 14 citations

    1

    h-index

  4. CF
    Christian Fremuth-Paeger

    University of Augsburg, Germany

    1 publications · 24 citations

    1

    h-index

  5. DW
    David Whitman

    Wyoming Department of Education, United States

    1 publications · 18 citations

    1

    h-index

1–5 of 19

Venues

  1. Networks

    3 publications · 49 citations

    3

    h-index

  2. 2

    h-index

  3. SIAM Journal on Computing

    2 publications · 598 citations

    2

    h-index

  4. Discrete Applied Mathematics

    1 publications · 18 citations

    1

    h-index

  5. Mathematical Methods of Operations Research

    1 publications · 74 citations

    1

    h-index

1–5