区间图上最短路径问题的最优并行算法。
Optimal parallel algorithm for shortest paths problem on interval graphs.
作者信息
Mishra P K
机构信息
Department of Applied Mathematics, Birla Institute of Technology, Mesra-Ranchi, 835215, India.
出版信息
J Zhejiang Univ Sci. 2004 Sep;5(9):1135-43. doi: 10.1631/jzus.2004.1135.
PMID:15323010
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.
摘要
本文提出了一种用于区间图中最短路径问题的高效并行算法，用于计算加权区间图中的最短路径，该算法在图中有n个区间时以O(n)时间运行。给出了一种用于确定区间图中最短路径的线性处理器CRCW算法。
Zotero 插件