1 paper
Liam Roditty, Roei Tov
Let G=(V,E) be an undirected graph with n vertices and m edges. We obtain the following new routing schemes: - A routing scheme for unweighted graphs that uses $\tilde O(\fra…