Deterministic conflict-free coloring for intervals
From MaRDI portal
Publication:4962749
DOI10.1145/1383369.1383375zbMath1445.68357OpenAlexW2004070233MaRDI QIDQ4962749
Panagiotis Cheilaris, Amotz Bar-Noy, Shakhar Smorodinsky
Publication date: 5 November 2018
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1383369.1383375
Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Online algorithms; streaming algorithms (68W27)
Related Items (20)
Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs ⋮ On Conflict-Free Multi-coloring ⋮ Conflict-Free Colourings of Uniform Hypergraphs With Few Edges ⋮ Conflict free colorings of (strongly) almost disjoint set-systems ⋮ Graph unique-maximum and conflict-free colorings ⋮ Polynomial Time Algorithms for Bichromatic Problems ⋮ Conflict-free coloring of points on a line with respect to a set of intervals ⋮ Tight bounds for online coloring of basic graph classes ⋮ On conflict-free connection of graphs ⋮ Strong conflict-free coloring for intervals ⋮ On variants of conflict-free-coloring for hypergraphs ⋮ Online Conflict-Free Colouring for Hypergraphs ⋮ Dynamic Offline Conflict-Free Coloring for Unit Disks ⋮ Parameterized algorithms for conflict-free colorings of graphs ⋮ Conflict-free connection of trees ⋮ Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points ⋮ Ordered Coloring Grids and Related Graphs ⋮ Tight Bounds for Online Coloring of Basic Graph Classes ⋮ Online hypergraph coloring with rejection ⋮ Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points.
This page was built for publication: Deterministic conflict-free coloring for intervals
