A measure for a balanced workload and its extremal values

DOI10.1016/J.DAM.2015.07.006zbMATH Open1329.05270OpenAlexW1028858378MaRDI QIDQ906433FDOQ906433

Authors: Jelena Govorčin, Riste Škrekovski, Vida Vukašinović, Damir Vukičević 

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

Recommendations

• Balanced loads in infinite networks
• Balanced centrality of networks
• Ultra-fast load balancing on scale-free networks
• Measuring centrality by a generalization of degree
• Centrality measures in networks

zbMATH Keywords

social networkscentrality measuresbetweenness centrality

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Extremal problems in graph theory (05C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Cites Work

• Community structure in social and biological networks
• The centrality of groups and classes
• On the sum of all distances in a graph or digraph
• STACS 2005
• Routing betweenness centrality
• Centrality and betweenness: vertex and edge decomposition of the Wiener index
• Locality-sensitive task allocation and load balancing in networked multiagent systems: talent versus centrality
• Title not available (Why is that?)

Cited In (3)

• On the connectivity and the diameter of betweenness-uniform graphs
• On the connectivity and the diameter of betweenness-uniform graphs
• Concerning the theory of workload control

This page was built for publication: A measure for a balanced workload and its extremal values

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q906433)