3471 search results - page 532 / 695 » Obstacle Numbers of Graphs |
168
Voted
INFOCOM
2008
IEEE
16 years 20 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...
132
click to vote
GD
2007
Springer
16 years 13 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 ...
158
click to vote
GECCO
2007
Springer
16 years 13 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...
192
click to vote
MOBICOM
2006
ACM
16 years 7 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...
169
click to vote
SIGIR
2006
ACM
16 years 6 days ago
2006
ACM
Since the website is one of the most important organizational structures of the Web, how to effectively rank websites has been essential to many Web applications, such as Web sear...