Inclusion of isolated nodes into the minimum spanning tree of an ad-hoc wireless sensor network
From MaRDI portal
Publication:3378271
zbMATH Open1089.68018MaRDI QIDQ3378271FDOQ3378271
Authors: A. Kooshesh, B. Ravikumar 
Publication date: 30 March 2006
Recommendations
- Incremental distributed asynchronous algorithm for minimum spanning trees
- MAXIMAL INDEPENDENT SET, WEAKLY-CONNECTED DOMINATING SET, AND INDUCED SPANNERS IN WIRELESS AD HOC NETWORKS
- Reconstructing a minimum spanning tree after deletion of any node
- Nearly linear time minimum spanning tree maintenance for transient node failures
- Associative parallel algorithm for dynamic update of a minimum spanning tree after addition of a new node to a graph
This page was built for publication: Inclusion of isolated nodes into the minimum spanning tree of an ad-hoc wireless sensor network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3378271)
