DIAMOND: a distributed algorithm for vertex coloring problems and resource allocation

The vertex colouring problem (VCP) and its generalisations have myriad applications in computer networks. To solve the VCP with $\Delta + 1$Δ+1 colours, numerous distributed algorithms based on LOCAL model have been proposed to reduce time complexity (the number of rounds), where $\Delta $Δ is the m...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IET networks Jg. 8; H. 6; S. 381 - 389
Hauptverfasser:	Miri, Mohammadhasan, Mohamedpour, Kamal, Darmani, Yousef, Sarkar, Mahasweta
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	The Institution of Engineering and Technology 01.11.2019
Schlagworte:	computer networks DIAMOND distributed algorithm distributed algorithms GEOM graphs graph colouring greedily generalised VCP maximum vertex degree modified LOCAL model myriad applications Research Article resource allocation resource allocation algorithms vertex colouring problem vertex colouring problem modified LOCAL model DIAMOND myriad applications computer networks graph colouring distributed algorithm resource allocation maximum vertex degree greedily generalised VCP distributed algorithms resource allocation algorithms GEOM graphs
ISSN:	2047-4954, 2047-4962, 2047-4962
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!