Pages that link to "Item:Q3058541"
From MaRDI portal
The following pages link to First-Fit Algorithm for the On-Line Chain Partitioning Problem (Q3058541):
Displayed 12 items.
- A subexponential upper bound for the on-line chain partitioning problem (Q276436) (← links)
- An extremal problem on crossing vectors. (Q458279) (← links)
- First-fit coloring of bounded tolerance graphs (Q531602) (← links)
- First-Fit is linear on posets excluding two long incomparable chains (Q651432) (← links)
- On-line chain partitions of orders: a survey (Q766153) (← links)
- Dimension of posets with planar cover graphs excluding two long incomparable chains (Q1734698) (← links)
- An easy subexponential bound for online chain partitioning (Q1753118) (← links)
- On-line dimension for posets excluding two long incomparable chains (Q1943697) (← links)
- On-line partitioning of width \(w\) posets into \(w^{O(\log\log w)}\) chains (Q2225405) (← links)
- (Q2857340) (← links)
- Reverse Mathematics and Grundy colorings of graphs (Q3053234) (← links)
- A Dichotomy Theorem for First-Fit Chain Partitions (Q5218437) (← links)