3211 search results - page 440 / 643 » On the Grundy Number of a Graph |
193
click to vote
IPPS
2003
IEEE
15 years 11 months ago
2003
IEEE
— We consider the problem of maintaining routing paths between nodes in a dynamic network. Gafni and Bertsekas proposed a link reversal approach called the BG method that maintai...
171
click to vote
ADBIS
2003
Springer
15 years 11 months ago
2003
Springer
Let a tuple of n objects obeying a query graph (QG) be called the n-tuple. The “Ddistance-value” of this n-tuple is the value of a linear function of distances of the n objects...
183
click to vote
CC
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. The register allocation in loops is generally performed after or during the software pipelining process. This is because doing a conventional register allocation at firs...
140
click to vote
CCS
2003
ACM
15 years 11 months ago
2003
ACM
Attacks against Internet routing are increasing in number and severity. Contributing greatly to these attacks is the absence of origin authentication: there is no way to validate ...
196
click to vote
ICDCS
2002
IEEE
15 years 11 months ago
2002
IEEE
The need for sharing is well known in a large number of distributed collaborative applications. These applications are difficult to develop for wide area (possibly mobile) networ...