On generating all maximal independent sets (Q1108809): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 02:03, 31 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On generating all maximal independent sets |
scientific article |
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