Strong conflict-free coloring for intervals

DOI10.1007/s00453-014-9929-xzbMath1306.05055OpenAlexW1979621790MaRDI QIDQ487034

Luisa Gargano, Adele A. Rescigno, Shakhar Smorodinsky, Panagiotis Cheilaris

Publication date: 19 January 2015

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-014-9929-x

zbMATH Keywords

wireless networksconflict-free coloringinterval hypergraph

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items (10)

Dynamic conflict-free colorings in the plane ⋮ Conflict-Free Coloring of Graphs ⋮ Conflict-Free Coloring of Intersection Graphs ⋮ Polynomial Time Algorithms for Bichromatic Problems ⋮ Complexity of conflict-free colorings of graphs ⋮ On variants of conflict-free-coloring for hypergraphs ⋮ Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points ⋮ Unnamed Item ⋮ Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points. ⋮ Dynamic Conflict-Free Colorings in the Plane

Cites Work

• Unnamed Item
• Unnamed Item
• Conflict-free coloring of points on a line with respect to a set of intervals
• Conflict-free coloring of unit disks
• Approximating Longest Cycles in Graphs with Bounded Degrees
• 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
• Online conflict-free coloring for halfplanes, congruent disks, and axis-parallel rectangles
• Conflict-Free Coloring and its Applications

This page was built for publication: Strong conflict-free coloring for intervals