Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Hi-index | 0.00 |
We study order preserving injections or bipartite matchings from poset V"1 to poset V"2. When V"1 is totally ordered, we give an efficient algorithm for the associated optimization problem and the convex hull of the corresponding characteristic vectors. If V"2 is totally ordered and V"1 is not, the problem is NP-complete.