On First-Fit coloring of ladder-free posets

DOI10.1016/j.ejc.2012.07.007zbMath1288.06004OpenAlexW1971238463MaRDI QIDQ691598

Matt Earl Smith, Henry A. Kierstead

Publication date: 3 December 2012

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2012.07.007

Mathematics Subject Classification ID

Partial orders, general (06A06) Online algorithms; streaming algorithms (68W27)

Related Items (3)

A subexponential upper bound for the on-line chain partitioning problem ⋮ An easy subexponential bound for online chain partitioning ⋮ A Dichotomy Theorem for First-Fit Chain Partitions

This page was built for publication: On First-Fit coloring of ladder-free posets