Parallel (delta + 1) coloring of constant-degree graphs
Technical Report
·
OSTI ID:6677570
This paper presents parallel algorithms for coloring a constant-degree graph with a maximum degree of delta in (delta + 1) colors and for finding a maximal independent set in a constant-degree graph. Given a graph with n vertices, the algorithms run in O (lg*n) time on EREW PRAM with O(n) processors. The algorithms use only local communication and achieve the same complexity bounds when implemented in the distributed model of parallel computation.
- Research Organization:
- Massachusetts Inst. of Tech., Cambridge (USA). Lab. for Computer Science
- OSTI ID:
- 6677570
- Report Number(s):
- AD-A-176290/5/XAB; VLSI-MEMO-86-355
- Country of Publication:
- United States
- Language:
- English
Similar Records
Efficient parallel algorithms for (5+1)-coloring and maximal independent set problems
Theoretical and experimental analyses of parallel combinatorial algorithms. Doctoral thesis
An optical simulation of shared memory
Technical Report
·
Wed Dec 31 23:00:00 EST 1986
·
OSTI ID:6487978
Theoretical and experimental analyses of parallel combinatorial algorithms. Doctoral thesis
Technical Report
·
Sun Oct 01 00:00:00 EDT 1989
·
OSTI ID:6963697
An optical simulation of shared memory
Conference
·
Wed Jun 01 00:00:00 EDT 1994
·
OSTI ID:10160474