Computing a K-independent set of maximal weight on a partially ordered set: A research case history.
Berenguer, Xavier
Qüestiió, Tome 5 (1981), p. 25-29 / Harvested from Biblioteca Digital de Matemáticas

This is a tutorial paper presenting the research carried out on the Sperner-Erdös problem, that is the problem of computing a Maximal Weighted K-Independent Set on a Partially Ordered set. Results are shown in the same order as the research was made: analysis and solution to the Sperner [sub]problem (K=1) and generalisation of this result yielding a polynomial solution to the Sperner-Erdös problem.

Publié le : 1981-01-01
DMLE-ID : 2638
@article{urn:eudml:doc:39971,
     title = {Computing a K-independent set of maximal weight on a partially ordered set: A research case history.},
     journal = {Q\"uestii\'o},
     volume = {5},
     year = {1981},
     pages = {25-29},
     language = {en},
     url = {http://dml.mathdoc.fr/item/urn:eudml:doc:39971}
}
Berenguer, Xavier. Computing a K-independent set of maximal weight on a partially ordered set: A research case history.. Qüestiió, Tome 5 (1981) pp. 25-29. http://gdmltest.u-ga.fr/item/urn:eudml:doc:39971/