3211 search results - page 435 / 643 » On the Grundy Number of a Graph |
182
click to vote
INFOCOM
2008
IEEE
16 years 29 days ago
2008
IEEE
In this paper, we characterize the performance of an important class of scheduling schemes, called Greedy Maximal Scheduling (GMS), for multi-hop wireless networks. While a lower ...
192
click to vote
CIBCB
2007
IEEE
16 years 27 days ago
2007
IEEE
The susceptible, infected, removed model for epidemics assumes that the population in which the epidemic takes place is well mixed. This strong assumption can be relaxed by permit...
171
click to vote
GLVLSI
2007
IEEE
16 years 27 days ago
2007
IEEE
A PAL-based logic block is the core of great majority of contemporary CPLD devices. The purpose of the paper is to present a new approach to multi-level synthesis for PAL-based CP...
164
click to vote
ICDM
2007
IEEE
16 years 26 days ago
2007
IEEE
Recently, there arise a large number of graphs with massive sizes and complex structures in many new applications, such as biological networks, social networks, and the Web, deman...
182
click to vote
IPPS
2007
IEEE
16 years 26 days ago
2007
IEEE
This paper deals with the self-stabilizing leader election algorithm of Xu and Srimani [10] that finds a leader in a tree graph. The worst case execution time for this algorithm ...