Analysis of Algorithms Finding the Maximum Flow of a Planar Network (1983)
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.
ANZSRC Fields of Research08 - Information and Computing Sciences::0802 - Computation Theory and Mathematics::080201 - Analysis of Algorithms and Complexity
RightsCopyright Lynn Loader
Showing items related by title, author, creator and subject.
Oo, C. H. (University of Canterbury. Computer Science, 1978)The Dantzig-Wolfe decomposition (linear programming) principle published in 1960 involves the solving of large-scale mathematical programming problems of particular structure. Large practical problems of this type typically ...
Xu, R.; Morris, K.A.; Woodward, G.K.; Kocak, T. (University of Canterbury. Electrical and Computer Engineering, 2012)Sequential decoding can achieve a very low computational complexity and short decoding delay when the signal- to-noise ratio (SNR) is relatively high. In this paper, a low-complexity high-throughput decoding architecture ...
Brown, R.G.; Chase, Geoff; Hann, C.E. (University of Canterbury. Electrical and Computer EngineeringUniversity of Canterbury. Mechanical Engineering, 2012)This paper describes an algorithm for 3D reconstruction of a smooth surface with a relatively dense set of self-similar point features from two calibrated views. We bypass the usual correspondence problem by triangulating ...