Distributed k-core algorithm

Earlier this year I gave at the talk at the March 4th, 2011 meeting of SCONE (Scottish Networking Event), on “Distributed k-shell graph decomposition”. The talk is on the k-core or k-shell of a graph, given in papers such as Seidman’s “Network Structure and Minimum Degree”, and it presents a new, efficient, distributed, algorithm for computing the maximal k-core membership of each node.

1 Comment »

  1. Paul Jakma said

    Short paper published by CoNext 2012, with an overview of proof, and describing an extension to allow the algorithm to work on dynamic graphs.

RSS feed for comments on this post · TrackBack URI

Leave a Reply

Please log in using one of these methods to post your comment:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: