Distributed k-core decomposition of dynamic graphs

  • Authors:

  • Paul Jakma;Marcin Orczyk;Colin S. Perkins;Marwan Fayed

  • Affiliations:

  • University of Glasgow, Glasgow, United Kingdom;University of Glasgow, Glasgow, United Kingdom;University of Glasgow, Glasgow, United Kingdom;University of Stirling, Stirling, United Kingdom

  • Venue:
  • Proceedings of the 2012 ACM conference on CoNEXT student workshop
  • Year:
  • 2012

  • Compact routing schemes

    Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures

Quantified Score

Hi-index 0.00

Visualization

Abstract

The k-core decomposition can be used to reveal structure in a graph. It is straight-forward to implement using a centralised algorithm with complete knowledge of the graph, but no distributed k-core decomposition algorithm has been published. We present a continuous, distributed, k-core decomposition algorithm for dynamic graphs, outline a proof of correctness, and give initial performance results. We briefly describe an application of this distributed k-core algorithm to landmark selection for compact routing.