Lower bounds for dynamic tree embedding in bipartite networks
From MaRDI portal
Publication:1273880
DOI10.1006/jpdc.1998.1475zbMath0916.68068OpenAlexW2129259156MaRDI QIDQ1273880
Si-Qing Zheng, Hong Shen, Yi Pan, Keqin Li, Gilbert H. Young
Publication date: 6 January 1999
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/9f95f71485c1ca8ffe450142379f92b5d20d039d
Related Items
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
