A METHOD FOR EVALUATING THE EXPECTED LOAD OF DYNAMIC TREE EMBEDDINGS IN HYPERCUBES
From MaRDI portal
Publication:5249037
DOI10.1142/S0129054100000132zbMath1319.68039OpenAlexW2135637754MaRDI QIDQ5249037
Publication date: 29 April 2015
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054100000132
hypercuberecurrence relationprobabilistic analysisrandom walkdynamic load distributionrandomized tree embedding
Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Randomized algorithms (68W20)
Related Items (2)
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
Cites Work
- Performance analysis for dynamic tree embedding in \(k\)-partite networks by a random walk
- Lower bounds for dynamic tree embedding in bipartite networks
- Taking random walks to grow trees in hypercubes
- Randomized parallel algorithms for backtrack search and branch-and-bound computation
- Embedding Trees in a Hypercube is NP-Complete
- Efficient Embeddings of Trees in Hypercubes
- Dynamic Tree Embeddings in Butterflies and Hypercubes
- Efficient randomized load distribution for tree structured computations on parallel and distributed computer systems
This page was built for publication: A METHOD FOR EVALUATING THE EXPECTED LOAD OF DYNAMIC TREE EMBEDDINGS IN HYPERCUBES
