Analysis of Algorithms Finding the Maximum Flow of a Planar Network
Type of content
Reports
UC permalink
Publisher's DOI/URI
Thesis discipline
Degree name
Bachelor of Science with Honours
Publisher
University of Canterbury. Computer Science
Journal Title
Journal ISSN
Volume Title
Language
Date
1983
Authors
Loader, Lynn
Abstract
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.
Description
Citation
Keywords
Ngā upoko tukutuku/Māori subject headings
ANZSRC fields of research
Field of Research::08 - Information and Computing Sciences::0802 - Computation Theory and Mathematics::080201 - Analysis of Algorithms and Complexity
Rights
Copyright Lynn Loader