Jakma, P., Orczyk, M., Perkins, C.S. and Fayed, M. (2012) Distributed k-core decomposition of dynamic graphs. In: ACM CoNEXT 2012 Student Workshop, Nice, France, 10 Dec 2012, pp. 39-40. (doi: 10.1145/2413247.2413272)
Full text not currently available from Enlighten.
Publisher's URL: http://dx.doi.org/10.1145/2413247.2413272
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 con- tinuous, 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.
| Item Type: | Conference Proceedings |
|---|---|
| Additional Information: | Proceedings ISBN: 9781450317795 |
| Status: | Published |
| Refereed: | Yes |
| Glasgow Author(s) Enlighten ID: | Jakma, Mr Paul and Perkins, Dr Colin |
| Authors: | Jakma, P., Orczyk, M., Perkins, C.S., and Fayed, M. |
| Subjects: | Q Science > QA Mathematics > QA76 Computer software |
| College/School: | College of Science and Engineering > School of Computing Science |
| Research Group: | ENDS |
University Staff: Request a correction | Enlighten Editors: Update this record
Altmetric
Altmetric