par Błasiok, Jarosław;Kaminski, Marcin 
Référence Lecture notes in computer science, 8246 LNCS, page (78-83)
Publication Publié, 2013
Référence Lecture notes in computer science, 8246 LNCS, page (78-83)
Publication Publié, 2013
Article révisé par les pairs
| Résumé : | Given two finite posets P and Q, P is a chain minor of Q if there exists a partial function f from the elements of Q to the elements of P such that for every chain in P there is a chain CQ in Q with the property that f restricted to CQ is an isomorphism of chains. We give an algorithm to decide whether a poset P is a chain minor of a poset Q that runs in time O( |
