We give query-efficient algorithms for the global min-cut and the st cut problem in
unweighted, undirected graphs. Our oracle model is inspired by the submodular function …

We investigate the problem of exactly reconstructing, with high confidence and up to
isomorphism, the ball of radius r centered at the starting state of a Markov process from …

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 or shortest path queries
between its vertices? We assume that the unknown graph G is connected, unweighted, and …

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 …

Graph reconstruction algorithms seek to learn a hidden graph by repeatedly querying a
blackbox oracle for information about the graph structure. Perhaps the most well studied and …

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 …

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 …

Digital presence in the world of online social media entails significant privacy risks. In this
work we consider a privacy threat to a social network in which an attacker has access to a …

How efficiently can we find an unknown graph using distance or shortest path queries
between its vertices? Let G=(V, E) G=(V, E) be a connected, undirected, and unweighted …