Dinics Algorith and Max Flows

Правка en5, от vivace_jr, 2018-08-03 23:56:04

There are so many different ways one can implement Dinic's, i have come across

1-> **EV^2** - https://github.com/PetarV-/Algorithms/blob/master/Graph%20Algorithms/Dinic%27s%20Algorithm.cpp
2-> **EV*log(maximum edge capcity)** -https://github.com/ADJA/algos/blob/master/Graphs/Dinic.cpp
3-> **EV*log(V)** - http://www.cs.tau.ac.il/~haimk/adv-alg-2013/dinic2013.pdf

Can anyone tell about or suggest some good tutorials where i can learn any of the following -> 1-> proof of Dinics 2-> proof of its timecomplexity (1st and 2nd types) 3-> implementation of third type(EVlog(V)) 4-> proof of 2nd type
Теги dinic, dinitz, max flow

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en5 Английский vivace_jr 2018-08-03 23:56:04 46
en4 Английский vivace_jr 2018-08-03 23:25:03 66 Tiny change: 'There are ' -> ' There are '
en3 Английский vivace_jr 2018-08-03 23:22:08 64
en2 Английский vivace_jr 2018-08-03 23:21:15 66
en1 Английский vivace_jr 2018-08-03 23:19:58 597 Initial revision (published)