Now showing items 1-3 of 3
A Distributed depth first Search based algorithm for edge connectivity estimation
The edge connectivity of a network is the minimum number of edges whose removal disconnect the network. The edge connectivity determines the minimum number of edge-disjoint paths between all nodes. Hence finding the edge ...
A progressive search algorithm for the minimum hitting set problem
Given a finite universe and a collection of the subsets of the universe, the minimum hitting set of thecollection is the smallest subset of the universe that has non-empty intersection with each set in thecollection. Finding ...
Parallel identification of central nodes in wireless multi-hop networks
A wireless multi-hop network is a collection of nodes that communicate by message passing over multiple links. Sending a message to a remote node can consume some energy from all intermediary nodes. In a network, the nodes ...