Asymptotically optimal dynamic tree evolution by rapidly mixing random walks on regular networks
DOI10.1016/J.JPDC.2010.05.003zbMATH Open1233.68030OpenAlexW2038432272MaRDI QIDQ666208FDOQ666208
Authors: Keqin Li 
Publication date: 7 March 2012
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jpdc.2010.05.003
Recommendations
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Mathematical problems of computer architecture (68M07) Network design and communication in computer systems (68M10) Distributed systems (68M14)
Cites Work
- Title not available (Why is that?)
- Randomized parallel algorithms for backtrack search and branch-and-bound computation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A proof of alon's second eigenvalue conjecture
- Performance analysis for dynamic tree embedding in \(k\)-partite networks by a random walk
- Lower bounds for dynamic tree embedding in bipartite networks
- On the performance of randomized embedding of reproduction trees in static networks
- Analysis of randomized load distribution for reproduction trees in linear arrays and rings
- Title not available (Why is that?)
- Taking random walks to grow trees in hypercubes
- Dynamic Tree Embeddings in Butterflies and Hypercubes
- Efficient randomized load distribution for tree structured computations on parallel and distributed computer systems
- Branch-and-bound and backtrack search on mesh-connected arrays of processors
- Title not available (Why is that?)
- A METHOD FOR EVALUATING THE EXPECTED LOAD OF DYNAMIC TREE EMBEDDINGS IN HYPERCUBES
Cited In (4)
This page was built for publication: Asymptotically optimal dynamic tree evolution by rapidly mixing random walks on regular networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q666208)
