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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Cluster computing Ročník 27; číslo 1; s. 875 - 891
Hlavní autoři:	Brighen, Assia, Slimani, Hachem, Rezgui, Abdelmounaam, Kheddouci, Hamamache
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.02.2024 Springer Nature B.V
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!