Optimal parallel algorithm for shortest-paths problem on interval graphs

DOI10.1631/JZUS.2004.1135MaRDI QIDQ3366282zbMATH OpenOpenAlexWikidataFDO

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

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Paths and cycles (05C38)

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

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• A linear-time algorithm for a special case of disjoint set union
• An efficient parallel algorithm for shortest paths in planar layered digraphs
• An optimal parallel algorithm for the minimum circle-cover problem
• Efficient algorithms for interval graphs and circular-arc graphs
• On a circle-cover minimization problem
• Parallel circle-cover algorithms
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

Cited in

(11)

• Algorithms for interval structures with applications
• scientific article; zbMATH DE number 62663 (Why is no real title available?)
• scientific article; zbMATH DE number 1522928 (Why is no real title available?)
• An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications
• scientific article; zbMATH DE number 7266346 (Why is no real title available?)
• Parallel implementation of shortest paths problem on weighted interval and circular arc graphs
• scientific article; zbMATH DE number 2208627 (Why is no real title available?)
• 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
• Algorithms for interval structures with applications
• scientific article; zbMATH DE number 56471 (Why is no real title available?)

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)