Transitive reduction in parallel via branchings
Book
·
OSTI ID:6471860
The authors study the following problem: given a strongly connected digraph, find a minimal strongly connected spanning subgraph of it. Their main result is a parallel algorithm for this problem, which runs in polylog parallel time and uses O(n{sup 3}) processors on a PRAM. The authors' algorithm is simple and the major tool it uses is computing a minimum-weigh branching with zero-one weights. They also present sequential algorithms for the problem that run in time (m + n {center dot} log n).
- OSTI ID:
- 6471860
- Country of Publication:
- United States
- Language:
- English
Similar Records
Transitive reduction in parallel via branchings. Technical report
Transitive reduction in parallel via branchings
Optimal parallel construction of prescribed tournaments
Technical Report
·
Sat Oct 01 00:00:00 EDT 1988
·
OSTI ID:6600365
Transitive reduction in parallel via branchings
Technical Report
·
Fri Jul 15 00:00:00 EDT 1988
·
OSTI ID:6980369
Optimal parallel construction of prescribed tournaments
Book
·
Wed Dec 31 23:00:00 EST 1986
·
OSTI ID:6837564