Analysis of Algorithms Finding the Maximum Flow of a Planar Network
Degree GrantorUniversity of Canterbury
Degree NameBachelor of Science with Honours
John H. Reif has recently developed an algorithm which finds the minimum cut of a planar network. This is a modification of an earlier algorithm presented by Itai and Shiloach and has a lower theoretical time bound than any other algorithm presented. This report compares the performance and discusses the implementation of Reif's and Itai and Shiloach's algorithms.
SubjectsField of Research::08 - Information and Computing Sciences::0802 - Computation Theory and Mathematics::080201 - Analysis of Algorithms and Complexity
- Engineering: Reports