Improved Self-Stabilizing Algorithms for L(2, 1)-Labeling Tree Networks
β Scribed by Pranay Chaudhuri; Hussein Thompson
- Book ID
- 107508953
- Publisher
- Springer-Verlag
- Year
- 2011
- Tongue
- English
- Weight
- 316 KB
- Volume
- 5
- Category
- Article
- ISSN
- 1661-8270
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Spanning trees help removing cycles and establishing short paths between a given node and the rest of the nodes in a network. In ad hoc mobile computing networks, however, transient node failures occur due to being out of range or powered off. Therefore, we present a self-stabilized distributed algo
The SAR70 program has been written as a tool within the SAR design method for supports. A support is a building in which a variety of floorplans for dwellings can hc made. The design method allows evaluation of such asupport. SAR7O can be used to generate all variations possible within a support str
The objective of the 2nd International Conference on Green Communications and Networks 2012 (GCN 2012) is to facilitate an exchange of information on best practices for the latest research advances in the area of communications, networks and intelligence applications. These mainly involve computer s