๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A dynamic trust network for autonomy-oriented partner finding

โœ Scribed by Jiming Liu; Hongjun Qiu; Ning Zhong; Chao Gao


Book ID
106387478
Publisher
Springer US
Year
2011
Tongue
English
Weight
919 KB
Volume
37
Category
Article
ISSN
0925-9902

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Distributed algorithms for finding and m
โœ Saurabh Srivastava; R.K. Ghosh ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 290 KB

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