An automatic node relabelling scheme for minimizing a matrix or network bandwidth

An automatic algorithm is presented for reducing the bandwidth of symmetric sparse connectivity matrices. The procedure takes an arbitrary input sequence and creates an optimal bandwidth for complex network systems by renumbering the node labels. Thus, considerable improvement for computer storage and time is achieved in the solution of the systems. A large number of examples is presented to demonstrate the reliability and the efficiency of the method.