95 search results - page 17 / 19 » Hamiltonian-Laceability of Star Graphs |
91
Voted
JAL
2006
14 years 9 months ago
2006
: We consider a variety of vehicle routing problems. The input to a problem consists of a graph G = (N, E) and edge lengths l(e) e E. Customers located at the vertices have to be ...
65
Voted
ICOIN
2007
Springer
15 years 3 months ago
2007
Springer
Wireless Sensor Network (WSN) deployed in hostile environments suffers from severe security threats. In this paper, we propose a Secure Message Percolation (SMP) scheme for WSN. We...
IPPS
1999
IEEE
15 years 1 months ago
1999
IEEE
We propose the recursive grid layout scheme for deriving efficient layouts of a variety of hierarchical networks and computing upper bounds on the VLSI area of general hierarchica...
IPPS
1998
IEEE
15 years 1 months ago
1998
IEEE
This paper shows the power of randomization in designing e cient parallel algorithms for the problems of routing and PRAM emulation. We show that with randomization techniques opti...
ICPP
1992
IEEE
15 years 1 months ago
1992
IEEE
-- Distributed routing algorithms presented in the literature have tended to be specific to a particular network topology. In order to test the applicability of various routing str...