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

Full description

Saved in:

Bibliographic Details
Published in:	International journal of parallel programming Vol. 53; no. 1; p. 1
Main Authors:	Brighen, Assia, Chouikh, Asma, Ikhlef, Hamida, Slimani, Hachem, Rezgui, Abdelmounaam, Kheddouci, Hamamache
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.02.2025 Springer Nature B.V
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!