Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms (Q3890128): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Eugene L. Lawler / rank | |||
| Property / author | |||
| Property / author: Jan Karel Lenstra / rank | |||
| Property / author | |||
| Property / author: Eugene L. Lawler / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Jan Karel Lenstra / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2093776691 / rank | |||
Normal rank | |||
Latest revision as of 00:05, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms |
scientific article |
Statements
Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms (English)
0 references
1980
0 references
NP-hardness
0 references
polynomial-time algorithms
0 references
independence system
0 references
satisfiability
0 references
maximality test
0 references
lexicography test
0 references
set packing
0 references
clique
0 references
complete k-partite subgraph
0 references
knapsack problem
0 references
facet generation
0 references
matroid intersection
0 references
