An Efficient Heuristic Procedure for Partitioning Graphs

Ford, 1962, Flows in Networks, 11

Lin, December 1965, “Computer Solutions of the Traveling Salesman Problem,”, B.S.T.J., 44, 2245

Kernighan , B. W. “Some Graph Partitioning Problems Related to Program Segmentation,” Ph.D. Thesis Princeton University January 1969 74 126

Kruskal, March 1964, “Multi-Dimensional Scaling by Optimizing Goodness of Fit to a Non-Metric Hypothesis,”, Psychometrika, 29, 1, 10.1007/BF02289565