An analysis of load-balancing algorithms on edge-Markovian evolving graphs
From MaRDI portal
Cites work
- A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.
- Approximating the Permanent
- Broadcasting in dynamic radio networks
- Cover time and mixing time of random walks on dynamic graphs
- Cover time in edge-uniform stochastically-evolving graphs
- Discrete load balancing on complete bipartite graphs
- Dynamic load balancing by random matchings
- Dynamic load balancing for a 2D concurrent plasma PIC code
- First- and second-order diffusive methods for rapid, coarse, distributed load balancing
- Flooding time of edge-Markovian evolving graphs
- scientific article; zbMATH DE number 5454133 (Why is no real title available?)
- Improved analysis of deterministic load-balancing schemes
- Information spreading in dynamic graphs
- Local divergence of Markov chains and the analysis of iterative load-balancing schemes
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- Near-perfect load balancing by randomized rounding
- On Counting the Population Size
- Parsimonious flooding in dynamic graphs
- Quasirandom load balancing
- Radio communication in random graphs
- Random Walks on Randomly Evolving Graphs
- Randomized diffusion for indivisible loads
- Randomized load balancing on networks with stochastic inputs
- Rumor spreading in random evolving graphs
- Theory of evolutionary computation. Recent developments in discrete optimization
- Thresholds for virus spread on networks
- Tight bounds for randomized load balancing on arbitrary network topologies
- Time-space trade-offs in population protocols for the majority problem
This page was built for publication: An analysis of load-balancing algorithms on edge-Markovian evolving graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7262359)
