A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Distributed algorithms for finding and maintaining a k-tree core in a dynamic network

2003
*
Information Processing Letters
*

A k-core C k of a tree T is subtree with exactly k leaves for k n l , where n l the number of leaves in T , and minimizes the sum of the distances of all nodes from C k . In this paper first we propose a distributed algorithm for constructing a rooted spanning tree of a dynamic graph such that root of the tree is located near the center of the graph. Then we provide a distributed algorithm for finding k-core of that spanning tree. The spanning tree is constructed in two stages. In the first

doi:10.1016/s0020-0190(03)00365-x
fatcat:ljyfmnia35h2bhmmpcczseecry