Transitive compaction in parallel via branchings

DOI10.1016/0196-6774(91)90026-UzbMath0718.68058MaRDI QIDQ5750415

Vijaya Ramachandran, Danny Soroker, Phillip B. Gibbons, Richard M. Karp, Robert Endre Tarjan

Publication date: 1991

Published in: Journal of Algorithms (Search for Journal in Brave)

zbMATH Keywords

strongly connected digraphsCREW PRAM

Mathematics Subject Classification ID

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

Related Items

Efficient parallel algorithms for path problems in directed graphs, Improved processor bounds for parallel algorithms for weighted directed graphs, The minimum spanning strong subdigraph problem is fixed parameter tractable