𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Dynamic CANON: a scalable multidomain core network

✍ Scribed by Stavdas, A.; Orphanoudakis, T.G.; Leligou, H.C.; Kanonakis, K.; Matrakidis, C.; Drakos, A.; Angelopoulos, J.D.; Lord, A.


Book ID
117893690
Publisher
IEEE
Year
2008
Tongue
English
Weight
119 KB
Volume
46
Category
Article
ISSN
0163-6804

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