|
|
|
|
|
Tobias Rupp and Stefan Funke
We prove a Ω(n)" role="presentation">O(??--v)O(n)
O
(
n
)
lower bound on the query time for contraction hierarchies (CH) as well as hub labels, two popular speed-up techniques for shortest path routing. Our construction is based on a graph fam...
ver más
|
|
|
|
|