The fixed point property in ordered sets of width two
โ Scribed by Tatyana S. Fofanova; Aleksander Rutkowski
- Publisher
- Springer Netherlands
- Year
- 1987
- Tongue
- English
- Weight
- 303 KB
- Volume
- 4
- Category
- Article
- ISSN
- 0167-8094
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
A simply polynomial time algorithm is given for computing the setup number, or jump number, of an ordered set with fixed width. This arises as an interesting application of a polynomial time algorithm for solving a more general weighted problem in precedence constrained scheduling.
In his paper [3], F.A.Valentine has defined a three-point property Pa. The first part of that paper contains results valid in n-space. In the second part is specialized to the plane, and among other things it is proved that a set is the union of two convex sets if it has the property P3 and there is