Transitive compaction in parallel via branchings
References (23)
- et al.
A fast and simple randomized parallel algorithm for the maximal independent set problem
J. Algorithms
(1986) - et al.
A linear-time algorithm for a special case of disjoint set union
J. Comput. System Sci.
(1985) - et al.
Parallel algorithms for shared memory machines
Fast parallel strong orientation of mixed graphs and related augmentation problems
J. Algorithms
(1988)- et al.
The transitive reduction of a directed graph
SIAM J. Comput.
(1972) - et al.
Improved processor bounds for parallel algorithms for directed graphs
(1988) - et al.
Matrix multiplication via arithmetic progressions
Edge-disjoint branchings
Optimum branchings
J. Res. Nat. Bur. Standards B
(1967)- et al.
Augmentation problems
SIAM J. Comput.
(1986)
Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
Combinatorica
(1986)
Cited by (10)
Finding strong components using depth-first search
2023, European Journal of CombinatoricsThe minimum spanning strong subdigraph problem is fixed parameter tractable
2008, Discrete Applied MathematicsOn finding minimal two-connected subgraphs
1995, Journal of AlgorithmsImproved processor bounds for parallel algorithms for weighted directed graphs
1993, Information Processing LettersStrongly connected spanning subdigraphs with the minimum number of arcs in quasi-transitive digraphs
2003, SIAM Journal on Discrete Mathematics
- ∗
Supported in part by the International Computer Science Institute, Berkeley, California.
- 1
Current affiliation: AT & T Bell Laboratories, Murray Hill, NJ 07974.
- †
Also supported by NSF Grant CCR-8411954. Current affiliation: University of California at Berkeley and International Computer Science Institute, Berkeley, CA.
- 2
Current affiliation: Shell Development Company, PO Box 481, Houston, TX 77011.
- §
Research at Princeton University partially supported by DIMACS (Center for Discrete Mathematics and Theoretical Computer Science), a National Science Foundation Science and Technology Center grant NSF-STC88-09648, and NSF Grant CCR-8920505. Current affiliation: Princeton University and NEC Research Institute, Princeton, NJ.
Copyright © 1991 Published by Elsevier Inc.