Preflow-Push: Improvement of Fo

2016-11-28  本文已影响5人  沉睡至夏
  1. Preflow-Push algorithm.
  2. Proof that if "f" is a preflow and "h" is a compatible node labeling, then there is no "s-t" path in the augmentation graph $G_f$ defined from f.
  3. Details of the Preflow-Push algorithm.
  4. Time analysis of the Preflow-Push algorithm. Bounding the number of relabels and saturating pushes
  5. Bounding the number of non-saturating pushes.
  6. Reducing the time bound by picking the node with maximum height among the nodes with excess.
上一篇下一篇

猜你喜欢

热点阅读