Distributed algorithms for finding and maintaining a k-tree core in a dynamic network.
Saurabh SrivastavaR. K. GhoshPublished in: Inf. Process. Lett. (2003)
Keyphrases
- peer to peer
- learning algorithm
- optimization problems
- cooperative
- computationally efficient
- network nodes
- computer networks
- worst case
- computational cost
- significant improvement
- wireless sensor networks
- neural network
- theoretical analysis
- distributed environment
- multi agent
- network management
- minimum spanning tree
- communication overhead
- dynamic networks
- bayesian networks
- distributed network
- tree mining