Sciweavers

88 search results - page 16 / 18
» cn 2004
Sort
View
CCCG
2004
13 years 7 months ago
Three-dimensional 1-bend graph drawings
We consider three-dimensional grid-drawings of graphs with at most one bend per edge. Under the additional requirement that the vertices be collinear, we prove that the minimum vo...
Pat Morin, David R. Wood
COCOON
2004
Springer
13 years 11 months ago
Fault Hamiltonicity of Meshes with Two Wraparound Edges
We consider the fault hamiltonian properties of m×n meshes with two wraparound edges in the first row and the last row, denoted by M2(m, n), m ≥ 2, n ≥ 3. M2(m, n) is a spann...
Kyoung-Wook Park, Hyeong-Seok Lim, Jung-Heum Park,...
CN
2004
148views more  CN 2004»
13 years 6 months ago
Multiway range trees: scalable IP lookup with fast updates
In this paper, we introduce a new IP lookup scheme with worst-case search and update time of O(log n), where n is the number of prefixes in the forwarding table. Our scheme is base...
Priyank Ramesh Warkhede, Subhash Suri, George Varg...
CN
2007
91views more  CN 2007»
13 years 6 months ago
On investigating overlay service topologies
Recently, a moderate amount of work has been reported on the use of overlay networks to support value-added network services, such as multicasting, Quality of Service (QoS), secur...
Zhi Li, Prasant Mohapatra
ADHOCNOW
2004
Springer
13 years 11 months ago
Connectivity of Wireless Sensor Networks with Constant Density
We consider a wireless sensor network in which each sensor is able to transmit within a disk of radius one. We show with elementary techniques that there exists a constant c such t...
Sarah Carruthers, Valerie King