An easy subexponential bound for online chain partitioning
From MaRDI portal
Publication:1753118
zbMath1390.06001arXiv1410.3247MaRDI QIDQ1753118
Bartłomiej Bosek, Grzegorz Matecki, Tomasz Krawczyk, Henry A. Kierstead, Matthew E. Smith
Publication date: 25 May 2018
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1410.3247
06A07: Combinatorics of partially ordered sets
05C15: Coloring of graphs and hypergraphs
68W27: Online algorithms; streaming algorithms