Edge v. Node Parallelism for Graph Centrality Metrics
- 1 January 2012
- book chapter
- Published by Elsevier BV
Abstract
No abstract availableThis publication has 3 references indexed in Scilit:
- Scale-free trees: The skeletons of complex networksPhysical Review E, 2004
- A faster algorithm for betweenness centrality*The Journal of Mathematical Sociology, 2001
- Emergence of Scaling in Random NetworksScience, 1999