1. R. Ahuja, J. Orlin, C. Stein, and R. E. Tarjan. Improved algorithms for bipartite network flow. Unpublished manuscript, 1989.
2. T. Y. Cheung. Multifacility location problem with rectilinear distance by the minimum-cut approach.ACM Transactions on Mathematical Software,6:549–561, 1980.
3. W. H. Cunningham. Computing the binding number of a graph. Manuscript, July 1988.
4. M. Eisner and D. Severance. Mathematical techniques for efficient record segmentation in large shared databases.Journal of the Association for Computing Machinery,23:619–635, 1976.
5. L. R. Ford and D. R. Fulkerson.Flows in Networks. Princeton University Press, Princeton, NJ, 1962.