Talk:Dinic's algorithm

Mathematics Start‑class Low‑priority

	Mathematics portal This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics
Start	This article has been rated as Start-class on Wikipedia's content assessment scale.
Low	This article has been rated as Low-priority on the project's priority scale.

Dinic or Dinitz?

Why is the Algorithm called Dinic's algorithm, when the guy who invented it is called Yefim Dinitz? That doesn't make sense to me - I think it should be both written the same. Wadi oo (talk) 09:17, 2 November 2009 (UTC)[reply]

Complexity of blocking flow calculation

Isn't it possible to find a blocking flow in a level graph in $O(V^{2})$ time using the Malhotra-Kumar-Maheshwari blocking flow (MPM) algorithm? This would yield an overall running time of $O(V^{3})$ . 82.130.21.149 (talk) 20:20, 7 December 2009 (UTC)[reply]

Former Russian?

Do we have any evidence to believe that he had renounced his Russian citizenship? If not, should we state that he is "former Russian"? Unless we are talking about ethnicity, in which case, he should have always been Jewish, and not either Israeli or Russian... just a thought ...