Preflow-Push: Improvement of Fold-Fulkerson

  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.
最后編輯于 ：
?著作權歸作者所有,轉載或內容合作請聯系作者
平臺聲明：文章內容（如有圖片或視頻亦包括在內）由作者上傳并發布，文章內容僅代表作者本人觀點，簡書系信息發布平臺，僅提供信息存儲服務。

推薦閱讀更多精彩內容