Optimal parallel algorithm for shortest paths problem on interval graphs |
| |
| Authors: | Mishra P K |
| |
| Institution: | Department of Applied Mathematics, Birla Institute of Technology, Mesra-Ranchi, 835215, India. pkmishra@ieee.org |
| |
| Abstract: | 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. |
| |
| Keywords: | |
| 本文献已被 维普 PubMed 等数据库收录！ |
|
