Seminar series
Date
Tue, 28 Oct 2008
Time
14:30 -
15:30
Location
L3
Speaker
Andy Twigg
Organisation
Oxford
Given
a graph G, we are asked to preprocess G and compute labels L(u) for
vertices such that given L(x) and L(y) we can efficiently answer d_G(x,y). I will describe some results in this area and some open problems.