On-Line Chain Partitions of Orders

@article{Felsner1997OnLineCP,
  title={On-Line Chain Partitions of Orders},
  author={Stefan Felsner},
  journal={Theor. Comput. Sci.},
  year={1997},
  volume={175},
  pages={283-292}
}
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 chain partitioned into (5 k ?1)=4 chains. We rst prove that width two orders can be partitioned on-line into 5 chains. Secondly, we introduce a variant of the game. We impose the restriction that… CONTINUE READING
Highly Cited
This paper has 38 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 23 extracted citations

References

Publications referenced by this paper.
Showing 1-4 of 4 references

Recursive ordered sets

H. A. Kierstaed
Contemp Math., 57:75-102, • 1986
View 7 Excerpts
Highly Influenced

An e ective version of Dilworth theorem

H. A. Kierstaed
Transact. Amer. Math. Soc., • 1981
View 7 Excerpts
Highly Influenced

A theory of recursive dimension for ordered sets

H. A. Kierstaed, G. F. McNulty, W. T. Trotter
Order , • 1984

Similar Papers

Loading similar papers…