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

Full description

Saved in:

Bibliographic Details
Published in:	Cluster computing Vol. 27; no. 1; pp. 875 - 891
Main Authors:	Brighen, Assia, Slimani, Hachem, Rezgui, Abdelmounaam, Kheddouci, Hamamache
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.02.2024 Springer Nature B.V
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!