Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A measure for a balanced workload and its extremal values

From MaRDI portal
Publication:906433
Jump to:navigation, search

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

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)


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
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:906433&oldid=12865480"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 17:41.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki