Giraph-Based Distributed Algorithms for Coloring Large-Scale Graphs

The Vertex Graph Coloring problem ( VGC ) is a well-known difficult combinatorial optimization problem. It is one of Karp’s 21 NP-complete problems. It consists in assigning a color to each vertex of a graph in such a way that any two neighboring vertices do not share the same color, and the number...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	International journal of parallel programming Jg. 53; H. 1; S. 1
Hauptverfasser:	Brighen, Assia, Chouikh, Asma, Ikhlef, Hamida, Slimani, Hachem, Rezgui, Abdelmounaam, Kheddouci, Hamamache
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.02.2025 Springer Nature B.V
Schlagworte:	Algorithms Apexes Combinatorial analysis Computer Science Frequency assignment Graph coloring Graph theory Optimization algorithms Parallel processing Processor Architectures Register allocation Saturation (color) Software Engineering/Programming and Operating Systems Theory of Computation Graph coloring problem Giraph Chromatic number Vertex-centric model
ISSN:	0885-7458, 1573-7640
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!