Transitive compaction in parallel via branchings
From MaRDI portal
Publication:5750415
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)
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