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

Ted H. Szymanski (1991)

Details and statistics

DOI:

access: unavailable

type: Conference or Workshop Paper

metadata version: 2014-07-28

a service of  Schloss Dagstuhl - Leibniz Center for Informatics