The server is under maintenance between 08:00 to 12:00 (GMT+08:00), and please visit later.
We apologize for any inconvenience caused
Login  | Sign Up  |  Oriprobe Inc. Feed
China/Asia On Demand
Journal Articles
Laws/Policies/Regulations
Companies/Products
Bookmark and Share
Optimal parallel algorithm for shortest-paths problem on interval graphs
Author(s): 
Pages: 129-137
Year: Issue:  9
Journal: Journal of Zhejiang University Science B

Keyword:  Parallel algorithmsShortest-paths problemInterval graphs;
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.
Related Articles
No related articles found