A depth first search algorithm to generate the family of maximal independent sets of a graph lexicographically (Q1157909): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Algorithm 457 / rank | |||
Normal rank | |||
Revision as of 06:49, 29 February 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
