This Article 
 Bibliographic References 
 Add to: 
Distributed k-Core Decomposition
Feb. 2013 (vol. 24 no. 2)
pp. 288-300
Alberto Montresor, University of Trento, Trento
Francesco De Pellegrini, CREATE-NET, Trento
Daniele Miorandi, CREATE-NET, Trento
Several novel metrics have been proposed in recent literature in order to study the relative importance of nodes in complex networks. Among those, k-coreness has found a number of applications in areas as diverse as sociology, proteinomics, graph visualization, and distributed system analysis and design. This paper proposes new distributed algorithms for the computation of the k-coreness of a network, a process also known as k-core decomposition. This technique 1) allows the decomposition, over a set of connected machines, of very large graphs, when size does not allow storing and processing them on a single host, and 2) enables the runtime computation of k-cores in “live” distributed systems. Lower bounds on the algorithms complexity are given, and an exhaustive experimental analysis on real-world data sets is provided.
Index Terms:
Computational modeling,Peer to peer computing,Arrays,Protocols,Optimization,Proteins,Measurement,bulk synchronous parallel,k-Core decomposition,graph analysis
Alberto Montresor, Francesco De Pellegrini, Daniele Miorandi, "Distributed k-Core Decomposition," IEEE Transactions on Parallel and Distributed Systems, vol. 24, no. 2, pp. 288-300, Feb. 2013, doi:10.1109/TPDS.2012.124
Usage of this product signifies your acceptance of the Terms of Use.