Improved processor bounds for parallel algorithms for weighted directed graphs
- 8 March 1993
- journal article
- Published by Elsevier BV in Information Processing Letters
- Vol. 45 (3), 147-152
- https://doi.org/10.1016/0020-0190(93)90017-4
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Transitive compaction in parallel via branchingsJournal of Algorithms, 1991
- An improved parallel algorithm that computes the BFS numbering of a directed graphInformation Processing Letters, 1988
- Optimum branchingsJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1967