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.

O29

179460k
在线咨询 用户反馈