✦ LIBER ✦

On-Line Chain Partitions of Orders: A Survey

✍ Scribed by Bartłomiej Bosek; Stefan Felsner; Kamil Kloch; Tomasz Krawczyk; Grzegorz Matecki; Piotr Micek

Book ID: 106489751
Publisher: Springer Netherlands
Year: 2011
Tongue: English
Weight: 567 KB
Volume: 29
Category: Article
ISSN: 0167-8094
DOI: 10.1007/s11083-011-9197-1

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 Up-growing S

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

✍ Stefan Felsner, Kamil Kloch, Grzegorz Matecki, Piotr Micek 📂 Article 📅 2011 🏛 Springer Netherlands 🌐 English ⚖ 388 KB

On-line Chain Partitioning of Up-growing

On-line Chain Partitioning of Up-growing Interval Orders

✍ Patrick Baier; Bartłomiej Bosek; Piotr Micek 📂 Article 📅 2007 🏛 Springer Netherlands 🌐 English ⚖ 410 KB

Chain partitions of ordered sets

✍ Willem L. Fouché 📂 Article 📅 1996 🏛 Springer Netherlands 🌐 English ⚖ 651 KB

Chain partitions of ordered sets

✍ Zbigniew Lonc 📂 Article 📅 1994 🏛 Springer Netherlands 🌐 English ⚖ 507 KB

On Spectral Minimal Partitions: A Survey

✍ B. Helffer 📂 Article 📅 2010 🏛 SP Birkhäuser Verlag Basel 🌐 English ⚖ 349 KB