Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms (Q3890128)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3696521
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms |
scientific article; zbMATH DE number 3696521 |
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
