Color a WCDS graph (4 colors).
[gc] = NARVAL_W_GColWCDS(g,n,cn)
graph.
list of master nodes (nucleus).
list of channels (nucleus).
colored graph.
NARVAL_W_GColWCDS colors the WCDS graph g in order to reduce interferences (WIKIPEDIA). A color is assigned to each master node, so that 2 neighbor nodes will have a different channel.n represents the list of WCDS master nodes. The list of colors attributed by the 4-color theorem to each master node is stored in cn (WIKIPEDIA). The output graph is stored in gc.
Dr. Foued Melakessou
Research Associate
Interdisciplinary Centre for Security, Reliability and Trust
Room F106
University of Luxembourg
6, rue Coudenhove Kalergi
L-1359 Luxembourg-Kirchberg
E-mail: foued.melakessou@uni.lu
Tel: (+352) 46 66 44 5346