On-line dimension for posets excluding two long incomparable chains
From MaRDI portal
Publication:1943697
DOI10.1007/s11083-011-9222-4zbMath1282.06007OpenAlexW2138023150MaRDI QIDQ1943697
Tomasz Krawczyk, Stefan Felsner, William T. jun. Trotter
Publication date: 20 March 2013
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11083-011-9222-4
2-person games (91A05) Applications of game theory (91A80) Combinatorics of partially ordered sets (06A07) Online algorithms; streaming algorithms (68W27)
Related Items (5)
Minors and dimension ⋮ An extremal problem on crossing vectors. ⋮ First-Fit is linear on posets excluding two long incomparable chains ⋮ Dimension of posets with planar cover graphs excluding two long incomparable chains ⋮ The graph of critical pairs of a crown
Cites Work
- First-Fit is linear on posets excluding two long incomparable chains
- On-line chain partitions of orders: a survey
- A note on first-fit coloring of interval graphs
- Dimension of the crown \(S^k_n\)
- Coloring interval graphs with First-Fit
- A theory of recursive dimension of ordered sets
- Intransitive indifference with unequal indifference intervals
- First-Fit Algorithm for the On-Line Chain Partitioning Problem
- The Linearity of First-Fit Coloring of Interval Graphs
- On some packing problem related to dynamic storage allocation
- An Effective Version of Dilworth's Theorem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On-line dimension for posets excluding two long incomparable chains
