Transitive compaction in parallel via branchings

Journal of Algorithms

Volumn 12, Issue 1, 1991, Pages 110-125

  Gibbons, Phillip ^a   Karp, Richard ^a   Ramachandran, Vijaya ^b   Soroker, Danny ^c   Tarjan, Robert ^d  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^c IBM ALMADEN RESEARCH CENTER   (United States)

^d PRINCETON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037814181     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/0196-6774(91)90026-U     Document Type: Article

References (23)

1. A fast and simple randomized parallel algorithm for the maximal independent set problem
2. The transitive reduction of a directed graph
3. Matrix multiplication via arithmetic progressions
4. Edge-disjoint branchings
5. Optimum branchings
6. Augmentation problems
7. Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
8. A linear-time algorithm for a special case of disjoint set union
9. A new parallel algorithm for the maximal independent set problem
10. Fast algorithms for finding nearest common ancestors
11. Parallel algorithms for shared memory machines
12. Are search and decision problems computationally equivalent?
13. A fast parallel algorithm for the maximal independent set problem
14. Computing ears and branchings in parallel
15. A simple parallel algorithm for the maximal independent set problem
16. Parallel tree contraction and its applications
17. Fast parallel algorithms for reducible flow graphs
18. Fast parallel strong orientation of mixed graphs and related augmentation problems
19. Finding optimum branchings
20. Edge-disjoint spanning trees and depth-first search