Various problems concerning greedy and super greedy linear extensions are shown to be NP-complete. In particular, the problem, due to Cogis, of determining that an ordered set is not greedy is NP-complete, as is the problem, due to Rival and Zaguia, of determining whether an ordered set has a greedy linear extension, which satisfies certain additional constraints.
ASJC Scopus subject areas
- Algebra and Number Theory
- Geometry and Topology
- Computational Theory and Mathematics