|
|
Journal of Zhejiang University SCIENCE A
ISSN 1673-565X(Print), 1862-1775(Online), Monthly
2004 Vol.5 No.9 P.1135-1143
Optimal parallel Algorithm for Shortest Paths Problem on Interval 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.
Key words: Parallel algorithms, Shortest-paths problem, Interval graphs
References:
Open peer comments: Debate/Discuss/Question/Opinion
<1>
Sovan Samanta@research scholar<navosmath@gmail.com>
2011-01-25 10:28:45
Respected sir
please give the paper as it is urgent for me.I will be thank ful to you.--
sovan samantaV.U.
DOI:
10.1631/jzus.2004.1135
CLC number:
O29
Download Full Text:
Downloaded:
2491
Clicked:
5226
Cited:
0
On-line Access:
Received:
2003-11-13
Revision Accepted:
2004-01-08
Crosschecked: