A measure for a balanced workload and its extremal values
From MaRDI portal
Publication:906433
DOI10.1016/j.dam.2015.07.006zbMath1329.05270OpenAlexW1028858378MaRDI QIDQ906433
Vida Vukašinović, Jelena Govorčin, Damir Vukičević, Riste Škrekovski
Publication date: 21 January 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2015.07.006
Social networks; opinion dynamics (91D30) Extremal problems in graph theory (05C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82)
Related Items
On the connectivity and the diameter of betweenness-uniform graphs, On the connectivity and the diameter of betweenness-uniform graphs
Cites Work
- Locality-sensitive task allocation and load balancing in networked multiagent systems: talent versus centrality
- On the sum of all distances in a graph or digraph
- Routing betweenness centrality
- The centrality of groups and classes
- Community structure in social and biological networks
- STACS 2005
- Unnamed Item
- Unnamed Item