Tight bounds for oblivious routing in the hypercube - Springer

We prove that in anyN-node communication network with maximum degreed, any deterministic oblivious algorithm for routing an arbitrary permutation requires ...

www.google.com.tw