A depth first search algorithm to generate the family of maximal independent sets of a graph lexicographically (Q1157909): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02277184 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W177258377 / rank | |||
Normal rank | |||
Latest revision as of 12:01, 30 July 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
