Skip to main content

All Questions

Filter by
Sorted by
Tagged with
4 votes
0 answers
220 views

Navigation in a graph

The problem Let $G=(V,E)$ be a graph. $k = O\left(\log(|V|)\right)$ distinct vertices are picked randomly from $V$. We call the set of chosen $k$ vertices $T$. Assumptions about the graph: You may ...
real's user avatar
  • 323