@MISC{GLIB_005.MIZ,
  AUTHOR = {Lee, Gilbert},
  NOTE1 = {Part of author's MSc work.},
  TITLE = {Proof of Ford/Fulkerson's Maximum Network Flow Algorithm},
  NOTE = {This work has been partially supported by the NSERC,
          Alberta Ingenuity Fund and iCORE.},
  SECTION1 = {Preliminary theorems},
  SECTION2 = {Preliminary definitions for Ford/Fulkerson Max-Flow Algorithm},
  SECTION3 = {Algorithm for Finding Augmenting Path in a Graph},
  SECTION4 = {Definition of Ford/Fulkerson Max-Flow Algorithm},
  SECTION5 = {Theorems for Ford/Fulkerson Max-Flow Algorithm},
  DAY = {22},
  MONTH = {February},
  YEAR = {2005},
  ADDRESS1 = {University of Victoria, Victoria, Canada},
  SUMMARY = {We define and prove correctness of Ford/Fulkerson's
  Maximum Network-Flow algorithm at the level of graph manipulations.}}
