Форд-Фулкерсонов алгоритам (Serbian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Форд-Фулкерсонов алгоритам" in Serbian language version.

refsWebsite

Global rank Serbian rank

2^nd place

4^th place

doi.org

Zwick, Uri (21. 8. 1995). „The smallest networks on which the Ford-Fulkerson maximum flow procedure may fail to terminate”. Theoretical Computer Science. 148 (1): 165—170. doi:10.1016/0304-3975(95)00022-O.