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...
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,...
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...
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...
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...