Anzeige
Erschienen in:
2013 | OriginalPaper | Buchkapitel
Conflict-Free Coloring and its Applications
verfasst von : Shakhar Smorodinsky
Erschienen in: Geometry — Intuitive, Discrete, and Convex
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.