Journal article

A note on order preserving matchings

We study order preserving injections or bipartite matchings from poset V1 to poset V2. When V1 is totally ordered, we give an efficient algorithm for the associated optimization problem and the convex hull of the corresponding characteristic vectors. If V2 is totally ordered and V1 is not, the problem is NP-complete.


Related material