Preflow-Push: Improvement of Fo
作者:
沉睡至夏 | 来源:发表于
2016-11-28 08:21 被阅读5次
- Preflow-Push algorithm.
- 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.
- Details of the Preflow-Push algorithm.
- Time analysis of the Preflow-Push algorithm. Bounding the number of relabels and saturating pushes
- Bounding the number of non-saturating pushes.
- Reducing the time bound by picking the node with maximum height among the nodes with excess.
本文标题： Preflow-Push: Improvement of Fo
本文链接：https://www.haomeiwen.com/subject/xktopttx.html
网友评论