Streaming algorithms for conflict-free coloring

DOI10.4230/LIPICS.WADS.2025.44MaRDI QIDQ7312596zbMATH OpenFDO

Authors Rogers Mathew, Fahad Panolan, Seshikanth

Publication date 11 August 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.WADS.2025.44

Mathematics Subject Classification ID

Data structures (68P05) Algorithms in computer science (68Wxx)

Cites work

• A short note on conflict‐free coloring on closed neighborhoods of bounded degree graphs
• A tight bound for conflict-free coloring in terms of distance to cluster
• Brooks’ theorem in graph streams: a single-pass semi-streaming algorithm for ∆-coloring
• Communication Complexity
• Conflict-free coloring and its applications
• Conflict-free coloring of unit disks
• Conflict-free coloring: graphs of bounded clique width and intersection graphs
• Conflict-Free Colorings of Rectangles Ranges
• Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
• Conflict-free colouring of graphs
• Conflict-free colourings of graphs and hypergraphs
• Conflict‐free chromatic number versus conflict‐free chromatic index
• Even the easiest(?) Graph coloring problem is not easy in streaming!
• Graph coloring via degeneracy in streaming and other space-conscious models
• scientific article; zbMATH DE number 7758308 (Why is no real title available?)
• scientific article; zbMATH DE number 7829269 (Why is no real title available?)
• Title not available (Why is no real title available?)
• Parameterized Complexity of Conflict-Free Graph Coloring
• Simple streaming algorithms for edge coloring
• Sublinear algorithms for ( + 1) vertex coloring

This page was built for publication: Streaming algorithms for conflict-free coloring

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