Optimal parallel algorithm for shortest paths problem on interval graphs.
This paper presents an efficient parallel algorithm for the shortest-path problem in interval graph for computing shortest-paths in a weighted interval graph that runs in O(n) time with n intervals in a graph. A linear processor CRCW algorithm for determining the shortest-paths in an interval graphs is given.
Department of Applied Mathematics, Birla Institute of Technology, Mesra-Ranchi, 835215, India. pkmishra@ieee.org
P K
PK
Mishra
D000465:Algorithms; D001185:Artificial Intelligence; D003198:Computer Simulation; D003205:Computing Methodologies; D016014:Linear Models; D008962:Models, Theoretical; D009716:Numerical Analysis, Computer-Assisted