in this research, performance of pattern search algorithm (ps) was investigated in order to optimize the nonlinear muskingum model parameters in contrast with the general algorithms, for wilson and karoun floods routing. wilson flood routing has been chosen to compare the ability of ps algorithm with other algorithms and, karoun flood routing has been chosen for a better evaluation of ps. the r...

The first and second Zagreb indices of a graph are equal, respectively, to the sum of squares of the vertex degrees, and the sum of the products of the degrees of pairs of adjacent vertices. We now consider analogous graph invariants, based on the second degrees of vertices (number of their second neighbors), called leap Zagreb indices. A number of their basic properties is established.

In a graph G, the first and second degrees of a vertex v is equal to thenumber of their first and second neighbors and are denoted by d(v/G) andd 2 (v/G), respectively. The first, second and third leap Zagreb indices are thesum of squares of second degrees of vertices of G, the sum of products of second degrees of pairs of adjacent vertices in G and the sum of products of firs...

Present study was undertaken to examine the extent of Polycyclic Aromatic Hydrocarbons (PAHs) contamination in neighbourhood lithospheric environment of landfill site situated in eastern outer edge of Kolkata metropolitan city in West Bengal, India, along with its sources identification, spatial distribution and probabilistic cancer risks to residents. The collection and analytical tests were p...

We present a family of approximation algorithms for minimum subset sum with a worst-case approximation ratio of (k + 1)/k and which run in linear time assuming that k is constant. We also present a family of linear-time approximation algorithms for subset sum with worst-case approximation factors of k/(k+1) assuming that k is constant. The algorithms use approaches from and improve upon previou...