An efficient noisy binary search in graphs via Median approximation (Q2115863): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 05:55, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient noisy binary search in graphs via Median approximation |
scientific article |
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
