LEARNING AUTOMATA-BASED ALGORITHMS FOR FINDING MINIMUM WEAKLY CONNECTED DOMINATING SET IN STOCHASTIC GRAPHS (Q3070074): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:47, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | LEARNING AUTOMATA-BASED ALGORITHMS FOR FINDING MINIMUM WEAKLY CONNECTED DOMINATING SET IN STOCHASTIC GRAPHS |
scientific article |
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
