CONFLICT-FREE COLORINGS OF SHALLOW DISCS

DOI10.1142/S0218195908002775zbMath1184.05038MaRDI QIDQ3604140

Noga Alon, Shakhar Smorodinsky

Publication date: 24 February 2009

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

combinatorial geometrywireless networksconflict-free colorings

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computational aspects related to convexity (52B55) Communication networks in operations research (90B18) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Oriented matroids in discrete geometry (52C40) Communication theory (94A05)

Related Items (4)

Conflict-free coloring of points on a line with respect to a set of intervals ⋮ On variants of conflict-free-coloring for hypergraphs ⋮ Conflict-free coloring of string graphs ⋮ Delaunay graphs of point sets in the plane with respect to axis‐parallel rectangles

Cites Work

• On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
• Discrete and computational geometry. The Goodman-Pollack Festschrift
• Applications of random sampling in computational geometry. II
• Conflict-free coloring of points and simple regions in the plane
• On The Chromatic Number of Geometric Hypergraphs
• Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
• Online Conflict‐Free Coloring for Intervals

This page was built for publication: CONFLICT-FREE COLORINGS OF SHALLOW DISCS