O (log N / log log N) Randomized Routing in Degree-log N Hypermeshes

Ted H. Szymanski. O (log N / log log N) Randomized Routing in Degree-log N Hypermeshes . In ICPP (1). pages 443-450, 1991.

Abstract

Abstract is missing.