Dynamic Tree Embeddings in Butterflies and Hypercubes

DOI10.1137/0221039MaRDI QIDQ4018398zbMATH OpenOpenAlexFDO

Authors Eric J. Schwabe, F. Thomson Leighton, M. E. J. Newman, Abhiram Ranade

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)

Cited in

(7)

• Analysis of randomized load distribution for reproduction trees in linear arrays and rings
• Efficient randomized load distribution for tree structured computations on parallel and distributed computer systems
• Optimal speedup for backtrack search on a butterfly network
• Branch-and-bound and backtrack search on mesh-connected arrays of processors
• A METHOD FOR EVALUATING THE EXPECTED LOAD OF DYNAMIC TREE EMBEDDINGS IN HYPERCUBES
• Deterministic parallel backtrack search
• Asymptotically optimal dynamic tree evolution by rapidly mixing random walks on regular networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4018398)