Optimal parallel construction of prescribed tournaments
Book
·
OSTI ID:6837564
A tournament is a digraph in which every pair of vertices is connected by exactly one arc. The score list of a tournament is the sorted list of the out-degrees of its vertices. Given a non-decreasing sequence of nonnegative integers, is it the score list of some tournament. There is a simple test for answering this question. There is also a simple sequential algorithm for constructing a tournament with a given score list. However, this algorithm has a greedy nature, and seems hard to parallelize. The authors present a simple parallel algorithm for the construction problem. The authors' algorithm runs in time O(logn) and uses O(n2/logn) processors on a CREW PRAM, where n is the number of vertices. Since the size of the output is THETA(n2), their algorithm achieves optimal speedup.
- OSTI ID:
- 6837564
- Country of Publication:
- United States
- Language:
- English
Similar Records
Fast parallel algorithms for finding Hamiltonian paths and cycles in a tournament
Transitive reduction in parallel via branchings. Technical report
Fast parallel algorithms for graphs and networks
Book
·
Wed Dec 31 23:00:00 EST 1986
·
OSTI ID:5384589
Transitive reduction in parallel via branchings. Technical report
Technical Report
·
Sat Oct 01 00:00:00 EDT 1988
·
OSTI ID:6600365
Fast parallel algorithms for graphs and networks
Thesis/Dissertation
·
Wed Dec 31 23:00:00 EST 1986
·
OSTI ID:5575747