3211 search results - page 490 / 643 » On the Grundy Number of a Graph |
GD
2007
Springer
14 years 3 months 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 ...
GECCO
2007
Springer
14 years 3 months 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...
MOBICOM
2006
ACM
14 years 3 months 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...
SIGIR
2006
ACM
14 years 3 months 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...
INFOCOM
2005
IEEE
14 years 2 months ago
2005
IEEE
— We consider the problem of link scheduling in a sensor network employing a TDMA MAC protocol. Our link scheduling algorithm involves two phases. In the first phase, we assign ...