Parcours dans les graphes: Un outil pour l'algorithmique des ensembles ordonnes

A finite poset can easily be represented by a directed acyclic graph. This work intends to make use of performant graph search methods as a tool for checking order properties. Semi-modular posets and semilattices are investigated here.An underlying idea consists in turning to account structural properties of the poset, and deriving effective algorithms. This purpose leads us to ‘good’ theoretic characterizations — that is, directly available from an algorithmic point of view — and especially a new one for modular lattices.