Optimal parallel algorithm for shortest-paths problem on interval graphs
From MaRDI portal
Publication:3366282
DOI10.1631/JZUS.2004.1135zbMATH Open1098.90060OpenAlexW2125205064WikidataQ54465795 ScholiaQ54465795MaRDI QIDQ3366282FDOQ3366282
Authors:
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
Recommendations
- Parallel implementation of shortest paths problem on weighted interval and circular arc graphs
- scientific article; zbMATH DE number 1140072
- An optimal algorithm to solve the all-pair shortest path problem on interval graphs
- Designing efficient parallel algorithms on interval graphs
- scientific article; zbMATH DE number 913360
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Efficient algorithms for interval graphs and circular-arc graphs
- A linear-time algorithm for a special case of disjoint set union
- On a circle-cover minimization problem
- Parallel circle-cover algorithms
- An optimal parallel algorithm for the minimum circle-cover problem
- An efficient parallel algorithm for shortest paths in planar layered digraphs
Cited In (11)
- Algorithms for interval structures with applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications
- Title not available (Why is that?)
- Parallel implementation of shortest paths problem on weighted interval and circular arc graphs
- Title not available (Why is that?)
- A simple optimal parallel algorithm for the minimum coloring problem on interval graphs
- Optimal sequential and parallel algorithms for computing the diameter and the center of an interval graph
- Title not available (Why is that?)
- Algorithms for interval structures with applications
This page was built for publication: Optimal parallel algorithm for shortest-paths problem on interval graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3366282)
