Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Shortest Path and Closure Algorithms for Banded Matrices.
 

Summary: ­
Shortest Path and Closure Algorithms
for Banded Matrices.
L. Allison,
T. I. Dix and
C. N. Yee.
Department of Computer Science, Monash University, Australia 3168.
Partially supported by Australian Research Grant A48830856.

Shortest Paths ­1­
Abstract. 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(nb 2 )
time and calculates all other path lengths in O(n 2 b) time.
Keywords: shortest path, negative cycle, closure, banded matrix, algorithm.
Preprint to Inf. Proc. Lett., 40, pp317­322, 30 Dec 1991, and TR 89/133 Dept. of Computer Science[*],
Monash University, Australia, 1989.
TR 89/133 & preprint to Inf. Proc. Lett. 40, pp.317­322 1991

Shortest Paths ­2­
1. Introduction.

  

Source: Allison, Lloyd - Caulfield School of Information Technology, Monash University

 

Collections: Computer Technologies and Information Sciences