Sciweavers

966 search results - page 137 / 194
» Small Alliances in Graphs
Sort
View
HICSS
2008
IEEE
153views Biometrics» more  HICSS 2008»
13 years 10 months ago
Fault-Tolerant k-Fold Pivot Routing in Wireless Sensor Networks
Selecting a small set of nodes called pivots, from all the nodes in a network and maintaining the routing infrastructure to and among each other can reduce routing overhead and ex...
Doina Bein
EJC
2006
13 years 10 months ago
A note on Ramsey numbers with two parameters
1 The Ramsey number R(G1, G2) is the smallest integer p such that for any graph G on p vertices2 either G contains G1 or G contains G2, where G denotes the complement of G. In this...
Yi Ru Huang, Jian Sheng Yang, Kemin Zhang
CORR
2007
Springer
76views Education» more  CORR 2007»
13 years 10 months ago
A Light-Based Device for Solving the Hamiltonian Path Problem
In this paper we suggest the use of light for performing useful computations. Namely, we propose a special device which uses light rays for solving the Hamiltonian path problem on ...
Mihai Oltean
CORR
2007
Springer
93views Education» more  CORR 2007»
13 years 10 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
AC
2004
Springer
13 years 9 months ago
Shotgun Sequence Assembly
Shotgun sequencing is the most widely used technique for determining the DNA sequence of organisms. It involves breaking up the DNA into many small pieces that can be read by auto...
Mihai Pop