# Computing on-line the lattice of maximal antichains of posets

@article{Jourdan1994ComputingOT,
title={Computing on-line the lattice of maximal antichains of posets},
author={Guy-Vincent Jourdan and Jean-Xavier Rampon and C. Jard},
journal={Order},
year={1994},
volume={11},
pages={197-210}
}
• Published 1994
• Mathematics
• Order
AbstractWe consider the on-line computation of the lattice of maximal antichains of a finite poset $$\tilde P$$ . This on-line computation satisfies what we call the “linear extension hypothesis”: the new incoming vertex is always maximal in the current subposet of $$\tilde P$$ . In addition to its theoretical interest, this abstraction of the lattice of antichains of a poset has structural properties which give it interesting practical behavior. In particular, the lattice of maximal antichains… Expand

#### References

SHOWING 1-10 OF 36 REFERENCES
The jump number and the lattice of maximal antichains
• K. Reuter
• Computer Science, Mathematics
• Discret. Math.
• 1991
Coloring inductive graphs on-line
• S. Irani
• Mathematics, Computer Science
• Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science
• 1990
TAPSOFT'93: Theory and Practice of Software Development
• Computer Science
• Lecture Notes in Computer Science
• 1993