Three indians' algorithm
Revision as of 15:38, 13 October 2014 by Weihe (talk | contribs) (Created page with "== General information == '''Algorithmic problem:''' Blocking flow. '''Type of algorithm:''' loop. == Abstract view == '''Invariant:''' The current flow is feasible....")
General information
Algorithmic problem: Blocking flow.
Type of algorithm: loop.
Abstract view
Invariant: The current flow is feasible.
Variant: The number of nodes strictly decreases.
Induction basis
Induction step
Remarks
- The algorithm is name after three indian researchers, V. M. Malhotra, M. Pramodh Kumar, and S. N. Mahashwari.
- Of course, the nodes need not really be removed from the graph. However, "removed" nodes must be hidden from the algorithm to ensure the asymptotic complexity; a Boolean lable "is removed" does not suffice for that.