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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	International journal of parallel programming Ročník 53; číslo 1; s. 1
Hlavní autori:	Brighen, Assia, Chouikh, Asma, Ikhlef, Hamida, Slimani, Hachem, Rezgui, Abdelmounaam, Kheddouci, Hamamache
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.02.2025 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!