A new backtracking algorithm for generating the family of maximal independent sets of a graph (Q786833): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0898-1221(83)90115-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2052864165 / rank | |||
Normal rank | |||
Revision as of 00:56, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new backtracking algorithm for generating the family of maximal independent sets of a graph |
scientific article |
Statements
A new backtracking algorithm for generating the family of maximal independent sets of a graph (English)
0 references
1983
0 references
branch-and-search algorithm
0 references
family of maximal independent sets
0 references
