An efficient noisy binary search in graphs via Median approximation (Q2115863)
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: An efficient noisy binary search in graphs via Median approximation |
scientific article; zbMATH DE number 7495028
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient noisy binary search in graphs via Median approximation |
scientific article; zbMATH DE number 7495028 |
Statements
An efficient noisy binary search in graphs via Median approximation (English)
0 references
22 March 2022
0 references
graph median
0 references
graph searching
0 references
noisy search
0 references
0 references
0 references
0 references
0 references
