In this paper a survey on the Radiocoloring Problem is presented. The Radiocoloring Problem (RCP) consists of an assignment of colors from the integer set (0..lambda) to the vertices of a graph, such that vertices at a distance of at most two get different colors and adjacent vertices get colors which are at least two apart. The aim is to minimize lambda. The RCP arose in the field of wireless radio networks, and it concerns the problem of frequency assignment. Since its formal definition, the RCP has been widely studied due both to its intrinsic theoretical interest and to. the growth of wireless networks.
On the radiocoloring problem / Calamoneri, Tiziana; Petreschi, Rossella. - 2571:(2002), pp. 118-127. (Intervento presentato al convegno 4th International Workshop on Distributed Computing tenutosi a CALCUTTA, INDIA nel DEC 28-31, 2002) [10.1007/3-540-36385-8_12].
On the radiocoloring problem
CALAMONERI, Tiziana;PETRESCHI, Rossella
2002
Abstract
In this paper a survey on the Radiocoloring Problem is presented. The Radiocoloring Problem (RCP) consists of an assignment of colors from the integer set (0..lambda) to the vertices of a graph, such that vertices at a distance of at most two get different colors and adjacent vertices get colors which are at least two apart. The aim is to minimize lambda. The RCP arose in the field of wireless radio networks, and it concerns the problem of frequency assignment. Since its formal definition, the RCP has been widely studied due both to its intrinsic theoretical interest and to. the growth of wireless networks.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
