𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On-line Chain Partitions of Up-growing Semi-orders

✍ Scribed by Stefan Felsner, Kamil Kloch, Grzegorz Matecki, Piotr Micek


Book ID
120755336
Publisher
Springer Netherlands
Year
2011
Tongue
English
Weight
388 KB
Volume
30
Category
Article
ISSN
0167-8094

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


On-line chain partitions of orders
✍ Stefan Felsner πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 698 KB

We analyze the on-line chain partitioning problem as a two-person game. One person builds an order one point at a time. The other person responds by making an irrevocable assignment of the new point to a chain of a chain partition. Kierstead gave a strategy showing that width k orders can be on-line

On-Line Chain Partitions of Orders: A Su
✍ BartΕ‚omiej Bosek; Stefan Felsner; Kamil Kloch; Tomasz Krawczyk; Grzegorz Matecki πŸ“‚ Article πŸ“… 2011 πŸ› Springer Netherlands 🌐 English βš– 567 KB
On-Line Dimension of Semi-Orders
✍ BartΕ‚omiej Bosek, Kamil Kloch, Tomasz Krawczyk, Piotr Micek πŸ“‚ Article πŸ“… 2012 πŸ› Springer Netherlands 🌐 English βš– 863 KB