TY - CHAP
T1 - Conflict-free coloring and its applications
AU - Smorodinsky, Shakhar
N1 - Publisher Copyright: © János Bolyai Mathematical Society and Springer-Verlag 2013.
PY - 2013/1/1
Y1 - 2013/1/1
N2 - Let H = (V, E) be a hypergraph. A conflict-free coloring of H is an assignment of colors to V such that, in each hyperedge e ∈ E, there is at least one uniquely-colored vertex. This notion is an extension of the classical graph coloring. Such colorings arise in the context of frequency assignment to cellular antennae, in battery consumption aspects of sensor networks, in RFID protocols, and several other fields. Conflict-free coloring has been the focus of many recent research papers. In this paper, we survey this notion and its combinatorial and algorithmic aspects.
AB - Let H = (V, E) be a hypergraph. A conflict-free coloring of H is an assignment of colors to V such that, in each hyperedge e ∈ E, there is at least one uniquely-colored vertex. This notion is an extension of the classical graph coloring. Such colorings arise in the context of frequency assignment to cellular antennae, in battery consumption aspects of sensor networks, in RFID protocols, and several other fields. Conflict-free coloring has been the focus of many recent research papers. In this paper, we survey this notion and its combinatorial and algorithmic aspects.
UR - http://www.scopus.com/inward/record.url?scp=84999589484&partnerID=8YFLogxK
U2 - https://doi.org/10.1007/978-3-642-41498-5_12
DO - https://doi.org/10.1007/978-3-642-41498-5_12
M3 - Chapter
T3 - Bolyai Society Mathematical Studies
SP - 331
EP - 389
BT - Bolyai Society Mathematical Studies
ER -