Lower Bounds for On-line Interval Coloring with Vector and Cardinality Constraints
From MaRDI portal
Publication:2971144
DOI10.1007/978-3-319-51963-0_25zbMath1444.68143arXiv1608.03078OpenAlexW2510343465MaRDI QIDQ2971144
Patryk Mikos, Grzegorz Gutowski
Publication date: 4 April 2017
Published in: SOFSEM 2017: Theory and Practice of Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.03078
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62) Online algorithms; streaming algorithms (68W27)
Cites Work
This page was built for publication: Lower Bounds for On-line Interval Coloring with Vector and Cardinality Constraints