This paper examines directed graphs related to convex polytopes. For each fixed d-polytope and any acyclic orientation of its graph, we prove there exist both convex and concave fu...
An approximation algorithm for a constraint satisfaction problem is said to be nontrivial if its performance ratio is strictly superior to the expected performance of the algorith...
Abstract. Geographical Information Science is essentially computational geography and has its own research program, namely all aspects of formal models for spatial natural processe...
In (2n)1)-stage rearrangeable networks, the routing time for any arbitrary permutation is X(n2 ) compared to its propagation delay O(n) only. Here, we attempt to identify the sets...
: Identifying PSL(2, C) as a projective group for patterns in the conformal camera model, the projective harmonic analysis on its double covering group SL(2, C) is presented in the...