The crust and the &Bgr;-Skeleton: combinatorial curve reconstruction
Graphical Models and Image Processing
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
On the complexity of distance-based evolutionary tree reconstruction
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Exploring networks with traceroute-like probes: theory and simulations
Theoretical Computer Science - Complex networks
On the longest path algorithm for reconstructing trees from distance matrices
Information Processing Letters
Optimal query complexity bounds for finding graphs
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
Balancing Graph Voronoi Diagrams
ISVD '09 Proceedings of the 2009 Sixth International Symposium on Voronoi Diagrams
Efficient measurement of complex networks using link queries
INFOCOM'09 Proceedings of the 28th IEEE international conference on Computer Communications Workshops
Optimally reconstructing weighted graphs using queries
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Road network reconstruction for organizing paths
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Topology discovery of sparse random graphs with few participants
Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Network discovery and verification with distance queries
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Combinatorial search on graphs motivated by bioinformatics applications: a brief survey
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
network discovery and verification
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Reconstructing curves with sharp corners
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
We study the problem of reconstructing a hidden graph given access to a distance oracle. We design randomized algorithms for the following problems: reconstruction of a degree bounded graph with query complexity $\tilde{O}(n^{3/2})$; reconstruction of a degree bounded outerplanar graph with query complexity $\tilde{O}(n)$; and near-optimal approximate reconstruction of a general graph.