We present an n-processor and O(lo~n)-time parallel RAM algorithm for finding a depth-first-search tree in an n·vertex planar graph. The algorithm is based on a new n-processor algorithm for finding a cyclic separator in a planar graph and Smith's original parallel depth-first-search algorithm for planar graphs [Smi86].

In this paper a new 3D plane rasterization algorithm based on weaving techniques is presented. This algorithm uses the coherence present in 3D parallel lines within the plane. Parallel lines have the same cyclic Freeman chain code but shifted by a parameter. This article provides the theory to determine this shift parameter.

In this paper, we prove that the Ricci tensor of an almost Kenmotsu 3-h-manifold is cyclic-parallel if and only if it is parallel and hence, the manifold is locally isometric to either the hyperbolic space H3(−1) or the Riemannian product H2(−4)× R. c ©2016 All rights reserved.

In this letter, we propose an appealing class of nonbinary quasi-cyclic low-density parity-check (QC-LDPC) cycle codes. The parity-check matrix is carefully designed such that the corresponding generator matrix has some nice properties: 1) systematic, 2) quasi-cyclic, and 3) sparse, which allows a parallel encoding with low complexity. Simulation results show that the performance of the propose...

The torsion of every metric connection on a Riemannian manifold has three components: one totally skew-symmetric, vectorial type and twistorial type, which is also called the traceless cyclic component. In this paper we classify complete simply connected manifolds carrying whose parallel, nonzero component vanishing

finite affine groups are given by groups of translations and di-lations on finite cyclic groups. for cyclic groups of prime orderwe develop a time-scale (wavelet) analysis and show that for alarge class of non-zero window signals/vectors, the generatedfull cyclic wavelet system constitutes a frame whose canonicaldual is a cyclic wavelet frame.

Dynamic redistribution of arrays is required very often in programs on distributed memory parallel computers. This paper presents eecient algorithms for redistribution between diierent cyclic(k) distributions, as deened in High Performance Fortran. We rst propose special optimized algorithms for a cyclic(x) to cyclic(y) redistribution when x is a multiple of y, or y is a multiple of x. We then ...

For a given group with a generating set A a dipole with jAj parallel directed edges labeled by elements of A gives rise to a voltage graph whose covering graph denoted by H A is a bipartite regular graph called a bi Cayley graph In the case when is abelian we refer to H A as a Haar graph of with respect to the symbol A In particular for cyclic the above graph is referred to as a cyclic Haar gra...

Diffusion is a slow transport mechanism and advective transport tends to dominate in large-size systems. An alternative transport mechanism is explored herein, whereby zero time-average cyclic fluid flow is compounded with pore-scale mixing to render effective transport. Two one-dimensional cyclic flow cases are analyzed: a rigid porous network with two open boundaries subjected to cyclic flow ...