| Optimal parallel algorithm for shortest-paths problem on interval graphs |
| |
| 作者姓名： | MISHRA P.K. |
| |
| 作者单位： | Department of |
| |
| 摘 要： | 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.
|
Optimal parallel algorithm for shortest-paths problem on interval graphs |
| |
| MISHRA P.K..Optimal parallel algorithm for shortest-paths problem on interval graphs[J].Journal of Zhejiang University Science,2004(9). |
| |
| Authors: | MISHRA PK |
| |
| 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 |
| 本文献已被 CNKI 等数据库收录！ |
