If the partial order of a set has at most one minimal element, then to test whether it has a non-crossing Hasse diagram its time complexity __________
If the partial order of a set has at most one minimal element, then to test whether it has a non-crossing Hasse diagram its time complexity __________ Correct Answer NP-complete
If the partial order has at most one minimal element, or it has at most one maximal element, then to test whether a partial order with multiple sources and sinks can be drawn as a crossing-free Hasse diagram or not it’s time complexity is NP-complete.