Jump to content

Talk:Dinic's algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 82.130.21.149 (talk) at 20:20, 7 December 2009. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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 time using the Malhotra-Kumar-Maheshwari blocking flow (MPM) algorithm? This would yield an overall running time of . 82.130.21.149 (talk) 20:20, 7 December 2009 (UTC)[reply]