Online coloring of short intervals
From MaRDI portal
Publication:6201896
DOI10.1016/J.EJC.2024.103919OpenAlexW2788939977WikidataQ129827014 ScholiaQ129827014MaRDI QIDQ6201896FDOQ6201896
Authors:
Publication date: 26 March 2024
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2024.103919
Online algorithms; streaming algorithms (68W27) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Algorithmic graph theory and perfect graphs
- Representation of a finite graph by a set of intervals on the real line
- On some packing problem related to dynamic storage allocation
- Title not available (Why is that?)
- Parallel and On-Line Graph Coloring
- Effective coloration
- On-line and first fit colorings of graphs
- Automata, Languages and Programming
- An on-line graph coloring algorithm with sublinear performance ratio
- Lower bounds for on-line graph coloring
- First-fit coloring on interval graphs has performance ratio at least 5
- A note on first-fit coloring of interval graphs
- Lower Bounds for On-line Graph Colorings
- An on-line competitive algorithm for coloring bipartite graphs without long induced paths
- Classes of interval graphs under expanding length restrictions
- An improved algorithm for online coloring of intervals with bandwidth
- On-line coloring of geometric intersection graphs
- Tight bounds for online coloring of basic graph classes
- On-line approach to off-line coloring problems on graphs with geometric representations
- Title not available (Why is that?)
- Online Coloring and $L(2,1)$-Labeling of Unit Disk Intersection Graphs
- Title not available (Why is that?)
This page was built for publication: Online coloring of short intervals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6201896)
