On-line chain partitions of orders

DOI10.1016/S0304-3975(96)00204-6zbMath0895.06004MaRDI QIDQ1392205

Stefan Felsner

Publication date: 23 July 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

number of chainson-line chain partitioning

Mathematics Subject Classification ID

2-person games (91A05) Combinatorics of partially ordered sets (06A07)

Related Items

A subexponential upper bound for the on-line chain partitioning problem ⋮ On-line dimension of semi-orders ⋮ On-line chain partitioning of up-growing interval orders ⋮ Improved lower bounds on the on-line chain partitioning of posets of bounded dimension ⋮ On-line chain partitions of up-growing semi-orders ⋮ On the online track assignment problem ⋮ Efficient dependency tracking for relevant events in concurrent systems ⋮ Lower bounds for randomized algorithms for online chain partitioning ⋮ On-line partitioning of width \(w\) posets into \(w^{O(\log\log w)}\) chains ⋮ An easy subexponential bound for online chain partitioning ⋮ On-line approach to off-line coloring problems on graphs with geometric representations ⋮ On-line chain partitions of orders: a survey

Cites Work

• Unnamed Item
• Unnamed Item
• A theory of recursive dimension of ordered sets
• An Effective Version of Dilworth's Theorem