Learning automata-based algorithms for finding minimum weakly connected dominating set in stochastic graphs (Q3070074)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5843915
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Learning automata-based algorithms for finding minimum weakly connected dominating set in stochastic graphs |
scientific article; zbMATH DE number 5843915 |
Statements
LEARNING AUTOMATA-BASED ALGORITHMS FOR FINDING MINIMUM WEAKLY CONNECTED DOMINATING SET IN STOCHASTIC GRAPHS (English)
0 references
2 February 2011
0 references
dominating set
0 references
weakly connected dominating set
0 references
stochastic graph
0 references
learning automata
0 references
distributed learning automata
0 references
0 references
0 references
0.8945022821426392
0 references
0.799913227558136
0 references
0.7628015875816345
0 references
