The dominating set concept in graphs has been used in many applications. In large graphs finding the minimum dominating set is difficult. The minimum dominating set problem in graphs seek a set D of minimum number of vertices such that each vertex of the graph is either in D or adjacent to a vertex in D. In a graph on n nodes if there is a single node of degree n-1 then that single node forms a...

Node cooperation is considered in this paper in the existence of two relaying protocols i.e. “Amplify and Forward (AF)” also called “Store and Forward (SF)” and the second relaying protocol is “Decode and Forward”. The two stated protocols are different from each other and perform different operations on received data before retransmitting to next hop. Also the selection of each protocol is var...

The authors presented people (Experiment 1) and pigeons (Experiments 2 and 3) with a large number of 1-way traveling salesperson problems that consisted of 3, 4, and 5 identical stimuli (nodes) on a computer monitor. The sequence of nodes that each traveler selected was recorded, and the distance of the route was subsequently determined. The routes the pigeons and people selected were reliably ...

background: the presence of metastatic lymph nodes is the most important prognostic factor for gastric carcinoma; however, the optimal system for the accurate staging of lymph node metastasis for patients with gastric cancer remains controversial. this study was designed to compare five systems in relation to the n classification of gastric carcinoma. materials and methods: this multicentric hi...

We investigate how the fixed-node diffusion Monte Carlo energy of solids depends on single-particle orbitals used in Slater-Jastrow wave functions. We demonstrate that the dependence can be significant, in particular in the case of 3d transition-metal compounds, which we adopt as examples. We illustrate how exchangecorrelation functionals with variable exact-exchange component can be exploited ...