An efficient parallel algorithm for shortest paths in planar layered digraphs

DOI10.1631/jzus.2004.0518zbMath1114.68456WikidataQ51999546 ScholiaQ51999546MaRDI QIDQ5490027

No author found.

Publication date: 4 October 2006

Published in: Journal of Zhejiang University-SCIENCE A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1631/jzus.2004.0518

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

05C38: Paths and cycles

68W10: Parallel algorithms in computer science

05C85: Graph algorithms (graph-theoretic aspects)

05C20: Directed graphs (digraphs), tournaments

Related Items

Optimal parallel algorithm for shortest-paths problem on interval graphs

Cites Work

• A note on two problems in connexion with graphs
• Dynamic maintenance of planar digraphs, with applications
• There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees
• On a routing problem
• Efficient Parallel Algorithms for String Editing and Related Problems
• Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
• A Separator Theorem for Planar Graphs
• Applications of a Planar Separator Theorem
• A faster parallel algorithm for a matrix searching problem
• Fibonacci heaps and their uses in improved network optimization algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item