Efficient parallel algorithms for (5+1)-coloring and maximal independent set problems
Technical Report
·
OSTI ID:6487978
An efficient technique for breaking symmetry in parallel is described. The technique works especially well on rooted trees and on graphs with a small maximum degree. In particular, a maximal independent set can be found on a constant-degree graph in O(lg*n) time on an EREW PRAM using a linear number of processors. It is shown how to apply this technique to construct more efficient parallel algorithms for several problems, including coloring of planar graphs and (delta + 1)-coloring of constant-degree graphs. Lower bounds for two related problems are proved.
- Research Organization:
- Massachusetts Inst. of Tech., Cambridge (USA). Lab. for Computer Science
- OSTI ID:
- 6487978
- Report Number(s):
- AD-A-178287/9/XAB; MIT/LCS/TM-320
- Country of Publication:
- United States
- Language:
- English
Similar Records
Parallel (delta + 1) coloring of constant-degree graphs
Theoretical and experimental analyses of parallel combinatorial algorithms. Doctoral thesis
Communication-efficient parallel-graph algorithms. Master's thesis
Technical Report
·
Sun Nov 30 23:00:00 EST 1986
·
OSTI ID:6677570
Theoretical and experimental analyses of parallel combinatorial algorithms. Doctoral thesis
Technical Report
·
Sun Oct 01 00:00:00 EDT 1989
·
OSTI ID:6963697
Communication-efficient parallel-graph algorithms. Master's thesis
Technical Report
·
Sun Jun 01 00:00:00 EDT 1986
·
OSTI ID:6626901