The bounded diameter minimum spanning tree (BDMST) problem is a combinatorial optimization problem appearing in applications such as wire-based communication network design when quality of service is of major concern and, for example, a signal between any two nodes in the network should not pass more than a fixed number of routers. It also arises in ad-hoc wireless networks and in the areas of ...

introduction: size of axillary lymph nodes can be a predictor for breast abnormalities. the agents in the antiperspirants such as aluminum were observed in the breast biopsy of individual with abnormalities and antiperspirants usage. in this study, the relation between using antiperspirants and the size of axillary lymph nodes were evaluated in iranian women. methods: in this study, 120 women w...

Mobile Ad hoc Network (MANET) consists of mobile nodes. Nodes are connected without any infrastructure. MANET ensures that lack of infrastructure, self organization and no access point. Mobile nodes are sharing their data whenever and wherever it’s needed. To maintain the effective data sharing, the data replication technique is needed. The main aim of the research work is to develop the data r...

Given a directed graph with n nodes andm edges, the (strong) edge connectivity λ(u, v) between two nodes u and v is the minimum number of edges whose deletion makes u and v not strongly connected. The problem of computing the edge connectivities between all pairs of nodes of a directed graph can be done in O(m) time by Cheung, Lau and Leung (FOCS 2011), where ω is the matrix multiplication fact...

Mobile Ad hoc Network (MANET) consists of mobile nodes. Nodes are connected without any infrastructure. MANET ensures that lack of infrastructure, self organization and no access point. Mobile nodes are sharing their data whenever and wherever it’s needed. To maintain the effective data sharing, the data replication technique is needed. The main aim of the research work is to develop the data r...

The problem of power allocation is studied for a multiple-input multiple-output (MIMO) decode-and-forward (DF) two-way relaying system consisting of two source nodes and one relay. It is shown that achieving maximum sum-rate in such a system does not necessarily demand the consumption of all available power at the relay. Instead, the maximum sum-rate can be achieved through efficient power allo...

Gossiping refers to the following task: In a group of individuals connected by a communication network, every node has a piece of information and needs to transmit it to all the nodes in the network. The networks are modeled by graphs, where the vertices represent the nodes, and the edges, the communication links. In this paper, we concentrate on minimum gossip graphs of even order, that is, gr...

We investigate the cost allocation strategy associated with problem of providing service /communication between all pairs network nodes. There is a each link and communication any pair nodes can be delivered via paths connecting those The example efficient solution which could provide for node (non-rooted) minimum spanning tree. such should distributed among users who might have conflicting int...

A watershed-based image segmentation using effective region merging strategy. The proposed algorithm is a hybrid segmentation technique. Firstly, a filter is implemented to detect the boundary of the objects in the input gray-scale image and we mark the minimum gray value of pixels before adopting watershed transformation. Each region is labeled by a unique number after the transform. Then each...

We consider a new network design problem that generalizes the Hop and Diameter Constrained Minimum Spanning and Steiner Tree Problem as follows: given an edge-weighted undirected graph whose nodes are partitioned into a set of root nodes, a set of terminals and a set of potential Steiner nodes, find a minimum-weight subtree that spans all the roots and terminals so that the number of hops betwe...