Abstract
We show that the problems of deciding whether an ordered set has at leastk depth-first linear extensions and whether an ordered set has at leastk greedy linear extensions are NP-hard.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have