The number of depth-first searches of an ordered set (Q909681): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The complexity of theorem-proving procedures / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: NP-completeness results concerning greedy and super greedy linear extensions / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 13:36, 20 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The number of depth-first searches of an ordered set |
scientific article |
Statements
The number of depth-first searches of an ordered set (English)
0 references
1989
0 references
NP-complete
0 references
depth-first linear extensions
0 references
greedy linear extensions
0 references
NP- hard
0 references
