On the probable behaviour of some algorithms for finding the stability number of a graph (Q3039396)
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: On the probable behaviour of some algorithms for finding the stability number of a graph |
scientific article; zbMATH DE number 3831991
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the probable behaviour of some algorithms for finding the stability number of a graph |
scientific article; zbMATH DE number 3831991 |
Statements
On the probable behaviour of some algorithms for finding the stability number of a graph (English)
0 references
1982
0 references
stable sets
0 references
stability number
0 references
binary search tree
0 references
constant edge-density
0 references
constant average degree
0 references
