Graph Theory Interpretation of Flow Matrices: A Note on Maximization Procedures for Identifying Significant Links

A maximization procedure for identifying significant links in a flow matrix is described and its use illustrated. The method appears to have advantages over primary-flow linkage methods and over methods based on flow-combination procedures.