Ultra-Fast Load Balancing on Scale-Free Networks
DOI10.1007/978-3-662-47666-6_41zbMath1440.68019OpenAlexW1842378158MaRDI QIDQ3449501
Martin Hoefer, Tobias Friedrich, Karl Bringmann, Ralf Rothenberger, Thomas Sauerwald
Publication date: 4 November 2015
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://www.repository.cam.ac.uk/handle/1810/295083
Random graphs (graph-theoretic aspects) (05C80) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14) Distributed algorithms (68W15)
Cites Work
- Unnamed Item
- On the spectra of general random graphs
- Random Graphs and Complex Networks
- A Fast Algorithm to Find All High Degree Vertices in Graphs with a Power Law Degree Sequence
- The Structure and Function of Complex Networks
- Discrete load balancing is (almost) as easy as continuous load balancing
- The average distances in random graphs with given expected degrees
- Efficient schemes for nearest neighbor load balancing
- Concentration of Measure for the Analysis of Randomized Algorithms
This page was built for publication: Ultra-Fast Load Balancing on Scale-Free Networks
