Sciweavers

1736 search results - page 283 / 348
» On antimagic directed graphs
Sort
View
CORR
2007
Springer
93views Education» more  CORR 2007»
13 years 11 months ago
Solving the Hamiltonian path problem with a light-based computer
Abstract. In this paper we suggest the use of light for performing useful computations. Namely, we propose a special computational device which uses light rays for solving the Hami...
Mihai Oltean
JSA
2008
124views more  JSA 2008»
13 years 11 months ago
Processor array architectures for flexible approximate string matching
In this paper, we present linear processor array architectures for flexible approximate string matching. These architectures are based on parallel realization of dynamic programmi...
Panagiotis D. Michailidis, Konstantinos G. Margari...
DM
2007
86views more  DM 2007»
13 years 11 months ago
Short cycle connectivity
Short cycle connectivity is a generalization of ordinary connectivity—two vertices have to be connected by a sequence of short cycles, in which two consecutive cycles have at le...
Vladimir Batagelj, Matjaz Zaversnik
DPD
2007
84views more  DPD 2007»
13 years 11 months ago
Disseminating dependent data in wireless broadcast environments
In wireless mobile environments, data broadcasting is an effective approach to disseminate information to mobile clients. In some applications, the access pattern of all the data c...
Chuan-Ming Liu, Kun-Feng Lin
IJAC
2007
64views more  IJAC 2007»
13 years 11 months ago
Star-Free Geodesic Languages for Groups
In this article we show that every group with a finite presentation satisfying one or both of the small cancellation conditions C (1/6) and C (1/4) − T (4) has the property that...
Susan M. Hermiller, Derek F. Holt, Sarah Rees