A depth first search algorithm to generate the family of maximal independent sets of a graph lexicographically (Q1157909)
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: A depth first search algorithm to generate the family of maximal independent sets of a graph lexicographically |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A depth first search algorithm to generate the family of maximal independent sets of a graph lexicographically |
scientific article |
Statements
A depth first search algorithm to generate the family of maximal independent sets of a graph lexicographically (English)
0 references
1981
0 references
maximal clique
0 references
