A measure for a balanced workload and its extremal values

DOI10.1016/J.DAM.2015.07.006MaRDI QIDQ906433zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 5663542 (Why is no real title available?)
• Centrality and betweenness: vertex and edge decomposition of the Wiener index
• Community structure in social and biological networks
• 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
• STACS 2005
• The centrality of groups and classes

Cited in

(3)

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

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)