Dynamic Tree Embeddings in Butterflies and Hypercubes

DOI10.1137/0221039zbMath0825.68482OpenAlexW2056986113MaRDI QIDQ4018398

Eric J. Schwabe, Abhiram G. Ranade, Frank Thompson Leighton, M. E. J. Newman

Publication date: 16 January 1993

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0221039

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (7)

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 ⋮ Optimal speedup for backtrack search on a butterfly network ⋮ Branch-and-bound and backtrack search on mesh-connected arrays of processors ⋮ Asymptotically optimal dynamic tree evolution by rapidly mixing random walks on regular networks ⋮ Deterministic parallel backtrack search ⋮ A METHOD FOR EVALUATING THE EXPECTED LOAD OF DYNAMIC TREE EMBEDDINGS IN HYPERCUBES

This page was built for publication: Dynamic Tree Embeddings in Butterflies and Hypercubes