3757 search results - page 590 / 752 » The overlap number of a graph |
166
click to vote
ALGOSENSORS
2009
Springer
16 years 1 months ago
2009
Springer
Sensor networks, with their ad hoc deployments, node mobility, and wireless communication, pose serious challenges for developing provably correct and efficient applications. A po...
176
click to vote
INFOCOM
2008
IEEE
16 years 25 days ago
2008
IEEE
—Recently proposed beaconless georouting algorithms are fully reactive, with nodes forwarding packets without prior knowledge of their neighbors. However, existing approaches for...
138
click to vote
GD
2007
Springer
16 years 18 days ago
2007
Springer
Let G = (V, E) be a graph with n vertices and m ≥ 4n edges drawn in the plane. The celebrated Crossing Lemma states that G has at least Ω(m3 /n2 ) pairs of crossing edges; or ...
160
click to vote
GECCO
2007
Springer
16 years 18 days ago
2007
Springer
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
200
click to vote
MOBICOM
2006
ACM
16 years 12 days ago
2006
ACM
Wireless sensor networks are tightly associated with the underlying environment in which the sensors are deployed. The global topology of the network is of great importance to bot...