Algorithm of determination of largest internally stable set of a graph (Q3673483)
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: Algorithm of determination of largest internally stable set of a graph |
scientific article; zbMATH DE number 3827582
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithm of determination of largest internally stable set of a graph |
scientific article; zbMATH DE number 3827582 |
Statements
Algorithm of determination of largest internally stable set of a graph (English)
0 references
1982
0 references
largest internally stable set of a graph
0 references
branch-and-bound
0 references
sequential analysis
0 references
