On-line chain partitioning of up-growing interval orders

DOI10.1007/s11083-006-9050-0zbMath1126.06001OpenAlexW2071546053WikidataQ36818461 ScholiaQ36818461MaRDI QIDQ2385526

Bartłomiej Bosek, Patrick Baier, Piotr Micek

Publication date: 12 October 2007

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11083-006-9050-0

zbMATH Keywords

interval orderchain partitioningon-line

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Partial orders, general (06A06) Combinatorics of partially ordered sets (06A07)

Related Items (4)

A subexponential upper bound for the on-line chain partitioning problem ⋮ On-line dimension of semi-orders ⋮ On-line chain partitions of up-growing semi-orders ⋮ On-line chain partitions of orders: a survey

Cites Work

• Unnamed Item
• Unnamed Item
• On-line chain partitions of orders
• Intransitive indifference with unequal indifference intervals
• A decomposition theorem for partially ordered sets
• An Effective Version of Dilworth's Theorem

This page was built for publication: On-line chain partitioning of up-growing interval orders