NP-completeness results concerning greedy and super greedy linear extensions (Q1087567): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 02:09, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | NP-completeness results concerning greedy and super greedy linear extensions |
scientific article |
Statements
NP-completeness results concerning greedy and super greedy linear extensions (English)
0 references
1986
0 references
The problem of determining that an ordered set is not greedy is NP- complete. Let \({\mathcal P}=(P,\leq)\) be an ordered set and \({\mathcal P}'\) a partial extension of \({\mathcal P}\). The problem of determining that there exists a (super) greedy linear extension of \({\mathcal P}\) which is also an extension of \({\mathcal P}'\) is NP-complete.
0 references
ordered set
0 references
greedy
0 references
NP-complete
0 references
partial extension
0 references
linear extension
0 references
