This paper develops a structural theory of unique shortest paths in real-weighted graphs.
Our main goal is to characterize exactly which sets of node sequences, which we call path …

How efficiently can we find an unknown graph using distance queries between its vertices?
We assume that the unknown graph is connected, unweighted, and has bounded degree …

How efficiently can we find an unknown graph using distance or shortest path queries
between its vertices? We assume that the unknown graph G is connected, unweighted, and …

A hidden graph is a graph whose edge set is hidden. A distance oracle of a graph G is a
black-box that receives two vertices of G and outputs the distance between the two vertices …

Let $ G=(V, E) $ be an $ n $-vertex connected graph of maximum degree $\Delta $. Given
access to $ V $ and an oracle that given two vertices $ u, v\in V $, returns the shortest path …

Given a partition of a graph into connected components, the membership oracle asserts
whether any two vertices of the graph lie in the same component or not. We prove that for …

Motivated from parallel network mapping, we provide efficient query complexity and round
complexity bounds for graph reconstruction using distance queries, including a bound that …

We consider the problem of learning a labeled hypergraph from a given family of
hypergraphs, using shortest path (SP) queries. An SP query specifies two vertices and asks …

Previous security research efforts orbiting around graphs have been exclusively focusing on
either (de-) anonymizing the graphs or understanding the security and privacy issues of …

Given a directed graph, G=(V, E), a path query, path (u, v), returns whether there is a
directed path from u to v in G, for u, v∈ V. Given only V, exactly learning all the edges in G …