|
|||||
|
|
Optimal parallel algorithm for shortest-paths problem on interval graphs |
|
| Authors: | |
| Institution: | (1) Department of Applied Mathematics, Birla Institute of Technology, 835215 Mesra-Ranchi, India |
| 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: | Parallel algorithms Shortest-paths problem Interval graphs |
| 本文献已被 万方数据 SpringerLink 等数据库收录！ | |