Pages that link to "Item:Q1273880"
From MaRDI portal
The following pages link to Lower bounds for dynamic tree embedding in bipartite networks (Q1273880):
Displaying 6 items.
- Asymptotically optimal dynamic tree evolution by rapidly mixing random walks on regular networks (Q666208) (← links)
- Load balanced tree embeddings (Q1199090) (← links)
- Performance analysis for dynamic tree embedding in \(k\)-partite networks by a random walk (Q1268832) (← links)
- On the performance of randomized embedding of reproduction trees in static networks (Q1878889) (← links)
- Analysis of randomized load distribution for reproduction trees in linear arrays and rings (Q1885897) (← links)
- A METHOD FOR EVALUATING THE EXPECTED LOAD OF DYNAMIC TREE EMBEDDINGS IN HYPERCUBES (Q5249037) (← links)