Speeding up cover time of sparse graphs using local knowledge (Q2798211)
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 6562469
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Speeding up cover time of sparse graphs using local knowledge |
scientific article; zbMATH DE number 6562469 |
Statements
Speeding Up Cover Time of Sparse Graphs Using Local Knowledge (English)
0 references
4 April 2016
0 references
random walks
0 references
random graphs
0 references
network exploration
0 references
0.8285833597183228
0 references
0.8273003697395325
0 references
0.8198227286338806
0 references
0.8156328797340393
0 references
