A new distributed graph coloring algorithm for large graphs

The vertex graph coloring problem (VGCP) is one of the most well-known problems in graph theory. It is used for solving several real-world problems such as compiler optimization, map coloring, and frequency assignment. The goal of VGCP is to color all vertices of the graph so that adjacent vertices...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Cluster computing Jg. 27; H. 1; S. 875 - 891
Hauptverfasser:	Brighen, Assia, Slimani, Hachem, Rezgui, Abdelmounaam, Kheddouci, Hamamache
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.02.2024 Springer Nature B.V
Schlagworte:	Algorithms Apexes Computation Computer Communication Networks Computer Science Frequency assignment Graph coloring Graph representations Graph theory Graphs Heuristic Operating Systems Parallel processing Processor Architectures Social networks Graph coloring problem Distributed computation Giraph Chromatic number Large graphs Vertex-centric model
ISSN:	1386-7857, 1573-7543
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!