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.
展开▼
机译：约翰·H·雷夫（John H. Reif）最近开发了一种算法，该算法可以找到平面网络的最小切口。这是对Itai和Shiloach提出的较早算法的修改，并且理论上的时限比提出的任何其他算法都低。该报告比较了性能，并讨论了Reif，Itai和Shiloach算法的实现。
展开▼
