Improved processor bounds for parallel algorithms for weighted directed graphs

DOI10.1016/0020-0190(93)90017-4zbMath0768.68022OpenAlexW2060929063MaRDI QIDQ1209343

Nancy M. Amato

Publication date: 16 May 1993

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2142/74584

zbMATH Keywords

single-source shortest path problemparallel algorithmweighted digraphprocessor bounds

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Related Items (1)

Parallel algorithms for the domination problems in trapezoid graphs

Cites Work

• Unnamed Item
• An improved parallel algorithm that computes the BFS numbering of a directed graph
• Optimum branchings
• Transitive compaction in parallel via branchings

This page was built for publication: Improved processor bounds for parallel algorithms for weighted directed graphs