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

DOI10.1142/S021819591940003XMaRDI QIDQ5234040zbMATH OpenOpenAlexFDO

Authors Tim Leijsen, Aleksandar Markovic, André van Renssen, Marcel Roeloffzen, Gerhard J. Woeginger, Mark 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

conflict-free coloringdynamic data structureskinetic data structures

Mathematics Subject Classification ID

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

Recommendations

• Fully-dynamic and kinetic conflict-free coloring of intervals with respect to points
• Conflict-free coloring of points on a line with respect to a set of intervals
• Dynamic conflict-free colorings in the plane
• Dynamic conflict-free colorings in the plane
• Conflict-free coloring of points with respect to rectangles and approximation algorithms for discrete independent set
• Conflict-free coloring of points and simple regions in the plane
• Strong conflict-free coloring for intervals
• Strong conflict-free coloring for intervals
• On conflict-free coloring of points and simple regions in the plane

Cites work

• Computational geometry. Algorithms and applications.
• Conflict-free coloring and its applications
• Conflict-free coloring made stronger
• Conflict-free coloring of points and simple regions in the plane
• Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
• Deterministic conflict-free coloring for intervals: from offline to online
• Dynamic conflict-free colorings in the plane
• Fully-dynamic and kinetic conflict-free coloring of intervals with respect to points
• scientific article; zbMATH DE number 5506191 (Why is no real title available?)
• scientific article; zbMATH DE number 3769624 (Why is no real title available?)
• Introduction to algorithms.
• On conflict-free multi-coloring
• Online conflict-free coloring for intervals
• Online conflict-free colouring for hypergraphs
• Strong conflict-free coloring for intervals

Cited in

(6)

• Dynamic conflict-free colorings in the plane
• Dynamic data structures for interval coloring
• Non-monochromatic and conflict-free colorings on tree spaces and planar network spaces
• Conflict-free coloring of points on a line with respect to a set of intervals
• Fully-dynamic and kinetic conflict-free coloring of intervals with respect to points
• Dynamic conflict-free colorings in the plane

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5234040)