Parallel (Δ + 1)-coloring of constant-degree graphs

This paper presents parallel algorithms for coloring a constant-degree graph with a maximum degree of Δ using Δ + 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 an EREW PRAM with O(n) processors. The...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Information processing letters 1987-06, Vol.25 (4), p.241-245
Hauptverfasser:	Goldberg, Andrew V., Plotkin, Serge A.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Applied sciences Computer science control theory systems Exact sciences and technology graph algorithm graph coloring Information processing Information retrieval. Graph Management information systems maximal independent set Parallel algorithm Theoretical computing Theory
Online-Zugang:	Volltext
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 Δ using Δ + 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 an EREW PRAM with O(n) processors. The algorithms use only local communication and achieve the same complexity bounds when implemented in a distributed model of parallel computation.
ISSN:	0020-0190 1872-6119
DOI:	10.1016/0020-0190(87)90169-4