Sciweavers

CIAC
2006
Springer
97views Algorithms» more  CIAC 2006»
13 years 8 months ago
Network Discovery and Verification with Distance Queries
The network discovery (verification) problem asks for a minimum subset Q V of queries in an undirected graph G = (V, E) such that these queries discover all edges and non-edges o...
Thomas Erlebach, Alexander Hall, Michael Hoffmann ...