Snapshot centrality indices in dynamic FIFO networks
From MaRDI portal
Publication:662157
DOI10.1007/S10852-011-9163-3zbMath1238.68111OpenAlexW2040899521MaRDI QIDQ662157
Tatiana M. Tabirca, Cormac J. Sreenan, Kenneth N. Brown
Publication date: 21 February 2012
Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10852-011-9163-3
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10)
Related Items (1)
Cites Work
- Unnamed Item
- Fully dynamic all pairs shortest paths with real edge weights
- The centrality index of a graph
- The shortest route through a network with time-dependent internodal transit times
- A faster algorithm for betweenness centrality*
- Community structure in social and biological networks
- An Incremental Algorithm for a Generalization of the Shortest-Path Problem
- Network Analysis
This page was built for publication: Snapshot centrality indices in dynamic FIFO networks