Network Discovery and Verification with Distance Queries
From MaRDI portal
Publication:3434544
DOI10.1007/11758471_10zbMath1183.68423OpenAlexW1567841639MaRDI QIDQ3434544
No author found.
Publication date: 2 May 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11758471_10
Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)
Related Items (4)
Near-Linear Query Complexity for Graph Inference ⋮ Unnamed Item ⋮ Reconstruction and verification of chordal graphs with a distance oracle ⋮ Finding hidden hubs and dominating sets in sparse graphs by randomized neighborhood queries
This page was built for publication: Network Discovery and Verification with Distance Queries
