Taking random walks to grow trees in hypercubes

DOI10.1145/174130.174144zbMath0785.68005OpenAlexW2042112191MaRDI QIDQ3140024

Sandeep N. Bhatt, Jin-Yi Cai

Publication date: 9 December 1993

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/174130.174144

zbMATH Keywords

random walksprobabilistic analysisgraph algorithmscombinatorial algorithmscomputation treeshypercube architecturesbinary trees on hypercube networksinterconnection architectureson-line embeddingtree surgery

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Mathematical problems of computer architecture (68M07) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Efficient randomized load distribution for tree structured computations on parallel and distributed computer systems ⋮ Analysis of randomized load distribution for reproduction trees in linear arrays and rings ⋮ Asymptotically optimal dynamic tree evolution by rapidly mixing random walks on regular networks ⋮ A METHOD FOR EVALUATING THE EXPECTED LOAD OF DYNAMIC TREE EMBEDDINGS IN HYPERCUBES

This page was built for publication: Taking random walks to grow trees in hypercubes