Optimal parallel algorithm for shortest-paths problem on interval graphs
From MaRDI portal
Publication:3366282
DOI10.1631/jzus.2004.1135zbMath1098.90060WikidataQ54465795 ScholiaQ54465795MaRDI QIDQ3366282
No author found.
Publication date: 13 February 2006
Published in: Journal of Zhejiang University-SCIENCE A (Search for Journal in Brave)
Full work available at URL: http://www.zju.edu.cn/jzus/2004/0409/040917.htm
Cites Work
- Unnamed Item
- Unnamed Item
- On a circle-cover minimization problem
- A linear-time algorithm for a special case of disjoint set union
- Parallel circle-cover algorithms
- An optimal parallel algorithm for the minimum circle-cover problem
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Efficient algorithms for interval graphs and circular-arc graphs
- An efficient parallel algorithm for shortest paths in planar layered digraphs