196
Voted
ICALP
2001
Springer
16 years 4 days ago
2001
Springer
Given an undirected graph with positive edge weights, define Nq(v) for each node v to be the set of q nodes closest to v (including v itself and breaking ties by node ID). It is ...