Optimizing node discovery on networks: problem definitions, fast algorithms, and observations (Q2201666)
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: Optimizing node discovery on networks: problem definitions, fast algorithms, and observations |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimizing node discovery on networks: problem definitions, fast algorithms, and observations |
scientific article |
Statements
Optimizing node discovery on networks: problem definitions, fast algorithms, and observations (English)
0 references
29 September 2020
0 references
submodular/supermodular set function
0 references
greedy algorithm
0 references
MCMC simulation
0 references
random walk
0 references
0 references
0.7197461128234863
0 references
0.7159032225608826
0 references
0.6996923685073853
0 references
0.6962031126022339
0 references
