A depth first search algorithm to generate the family of maximal independent sets of a graph lexicographically (Q1157909): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 05:34, 31 January 2024
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
