Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points

DOI10.1142/S021819591940003XzbMath1457.68283OpenAlexW2576802286MaRDI QIDQ5234040

Marcel Roeloffzen, Aleksandar Markovic, Tim Leijsen, Gerhard J. Woeginger, André van Renssen, Mark T. de Berg

Publication date: 9 September 2019

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

Full work available at URL: https://doi.org/10.1142/s021819591940003x

zbMATH Keywords

kinetic data structuresdynamic data structuresconflict-free coloring

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)

Related Items (1)

Non-monochromatic and conflict-free colorings on tree spaces and planar network spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strong conflict-free coloring for intervals
• Conflict-free coloring of points and simple regions in the plane
• On Conflict-Free Multi-coloring
• Conflict-Free Coloring Made Stronger
• Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
• Online Conflict-Free Colouring for Hypergraphs
• Deterministic conflict-free coloring for intervals
• Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points.
• Dynamic Conflict-Free Colorings in the Plane
• Conflict-Free Coloring and its Applications

This page was built for publication: Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points