On generating all maximal independent sets (Q1108809)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On generating all maximal independent sets |
scientific article; zbMATH DE number 4068316
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On generating all maximal independent sets |
scientific article; zbMATH DE number 4068316 |
Statements
On generating all maximal independent sets (English)
0 references
1988
0 references
We present an algorithm that generates all maximal independent sets of a graph in lexicographic order, with only polynomial delay between the output of two successive independent sets. We also show that there is no polynomial-delay algorithm for generating all maximal independent sets in reverse lexicographic order, unless \(P=NP\).
0 references
enumeration
0 references
NP-complete
0 references
independent sets
0 references
lexicographic order
0 references
0 references
0.9340682
0 references
0.92265403
0 references
0.9163451
0 references
0.9028497
0 references
0.89683545
0 references
0.8900584
0 references
0.8882263
0 references
