Reconstructing weighted graphs with minimal query complexity (Q2431425)
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 5878095
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reconstructing weighted graphs with minimal query complexity |
scientific article; zbMATH DE number 5878095 |
Statements
Reconstructing weighted graphs with minimal query complexity (English)
0 references
14 April 2011
0 references
combinatorial search
0 references
reconstructing hidden graphs
0 references
genome sequencing
0 references
0 references
0.993428111076355
0 references
0.9319934844970704
0 references
0.8797853589057922
0 references
0.8249641060829163
0 references
0.8031620383262634
0 references
