Shortest Path and Closure Algorithms for Banded Matrices

A fast algorithm is given for the all-pairs shortest paths problem for banded matrices having band-width b. It solves the negative-cycle problem and calculates all path lengths within the band in O(nb2) time and calculates all other path lengths in O(n2b) time.

[1]  Jin Y. Yen.  Technical Note - On Hu's Decomposition Algorithm for Shortest Paths in a Network , 1971, Oper. Res..

[2]  I. Duff.  A survey of sparse matrix research , 1977, Proceedings of the IEEE.

[3]  T. C. Hu,et al.  Shortcut in the decomposition algorithm for shortest paths in a network , 1969 .

[4]  C. N. Yee,et al.  Restriction site mapping is in separation theory , 1988, Comput. Appl. Biosci..

[5]  Trevor I. Dix,et al.  Errors between sites in restriction site mapping , 1988, Comput. Appl. Biosci..

[6]  Stephen Warshall,et al.  A Theorem on Boolean Matrices , 1962, JACM.

[7]  Trevor I. Dix,et al.  Constraint checking for restriction site mapping , 1991, Proceedings of the Twenty-Fourth Annual Hawaii International Conference on System Sciences.

[8]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.