Pages that link to "Item:Q1087567"
From MaRDI portal
The following pages link to NP-completeness results concerning greedy and super greedy linear extensions (Q1087567):
Displaying 7 items.
- Computing an evolutionary ordering is hard (Q324805) (← links)
- NP-completeness properties about linear extensions (Q581427) (← links)
- The number of depth-first searches of an ordered set (Q909681) (← links)
- Representing an ordered set as the intersection of super greedy linear extensions (Q1104948) (← links)
- On minimizing the jump number for interval orders (Q1111581) (← links)
- On some new types of greedy chains and greedy linear extensions of partially ordered sets (Q1894377) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311112) (← links)