Finding paths in sparse random graphs requires many queries (Q2951884)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding paths in sparse random graphs requires many queries |
scientific article |
Statements
Finding paths in sparse random graphs requires many queries (English)
0 references
10 January 2017
0 references
random graphs
0 references
paths
0 references
queries
0 references
economic
0 references
