Efficient parallel algorithms for planar st-graphs

DOI10.1007/S00453-002-0995-0MaRDI QIDQ1400882zbMATH OpenOpenAlexFDO

Authors Mikhail J. Atallah, Danny Z. Chen, Ovidiu Daescu

Publication date 17 August 2003

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-002-0995-0

zbMATH Keywords

AlgorithmsEREW PRAMParallel computingSortingMergingPartitioningMulti-selection

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Recommendations

• A simple parallel algorithm for the single-source shortest path problem on planar digraphs
• An efficient parallel algorithm for shortest paths in planar layered digraphs
• scientific article; zbMATH DE number 176745
• Efficient parallel algorithms for shortest paths in planar graphs
• Efficient parallel algorithms for shortest paths in planar digraphs

Cited in

(8)

• scientific article; zbMATH DE number 3958744 (Why is no real title available?)
• An efficient parallel algorithm for shortest paths in planar layered digraphs
• An efficient parallel algorithm for shortest paths in planar layered digraphs
• Efficient parallel algorithms for shortest paths in planar digraphs
• Parallel Transitive Closure and Point Location in Planar Structures
• Efficient parallel algorithms for shortest paths in planar graphs
• Parallel nested dissection for path algebra computations
• Parallel Algorithms for Depth-First Searches I. Planar Graphs

This page was built for publication: Efficient parallel algorithms for planar \(st\)-graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1400882)