Conflict-Free Coloring and its Applications

Details Conflict-Free Coloring and its Applications Conflict-Free Coloring and its Applications

2010-05-20

arxiv.org/abs/1005.3616v3

Mathematics

Combinatorics

35 pages

Scientific paper

Let $H=(V,E)$ be a hypergraph. A {\em conflict-free} coloring of $H$ is an assignment of colors to $V$ such that in each hyperedge $e \in 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, and has been the focus of many recent research papers. In this paper, we survey this notion and its combinatorial and algorithmic aspects.

Affiliated with

Also associated with

No associations

Rating

Conflict-Free Coloring and its Applications does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Conflict-Free Coloring and its Applications, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Conflict-Free Coloring and its Applications will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-209425