Finding minimum weight connected dominating set in stochastic graph based on learning automata (Q712488)
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: Finding minimum weight connected dominating set in stochastic graph based on learning automata |
scientific article; zbMATH DE number 6094389
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding minimum weight connected dominating set in stochastic graph based on learning automata |
scientific article; zbMATH DE number 6094389 |
Statements
Finding minimum weight connected dominating set in stochastic graph based on learning automata (English)
0 references
17 October 2012
0 references
dominating set
0 references
minimum connected dominating set
0 references
stochastic graph
0 references
learning automata
0 references
0 references
0 references
0 references
0.8945022821426392
0 references
0.8378214836120605
0 references
0.7907643914222717
0 references
0.7792602777481079
0 references
