Pages that link to "Item:Q6139864"
From MaRDI portal
The following pages link to Improved lower bounds on the on-line chain partitioning of posets of bounded dimension (Q6139864):
Displaying 5 items.
- An \(\Omega\) (n log n) lower bound for decomposing a set of points into chains (Q1124331) (← links)
- On-line chain partitioning of up-growing interval orders (Q2385526) (← links)
- First-Fit Algorithm for the On-Line Chain Partitioning Problem (Q3058541) (← links)
- (Q3575997) (← links)
- Improved lower bound on the on-line chain partitioning of semi-orders with representation (Q6056742) (← links)