Parallel (Delta + 1) Coloring of Constant-Degree Graphs

Parallel (Delta + 1) Coloring of Constant-Degree Graphs

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Goldberg,Andrew V, Plotkin,Serge A
Format: Report
Sprache:eng
Schlagworte:
ALGORITHMS
COLORING
COLORS
COMPUTATIONS
DISTRIBUTION
GRAPHS
PARALLEL ORIENTATION
PARALLEL PROCESSING
Theoretical Mathematics
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.