The problem of complex tasks related to set of points on a plane with help of a generalized and optimized algorithm is considered. The algorithm is easily parallelized. Theoretical analysis has been carried out and practical results have been obtained.

We prove exact results on dilations in cycles for important parallel computer interconnection networks as complete trees, hypercubes and 2and 3-dimensional meshes. Moreover we show that trees, X-trees, n-dimensional meshes, pyramids and trees of meshes have the same dilations both in the path and in the cycle. 3

Casimir forces of massive ferrnionic Dirac fields are calculated for parallel plates geometry in spatial space with dimension d and imposing bag model boundary conditions. It is shown that in the range of ma>>l where m is mass of fields quanta and a is the separation distance of the plates, it is equal to massive bosonic fields Casimir force for each degree of freedom. We argue this equalit...