9 search results - page 2 / 2 » sirocco 2010 |
SIROCCO
2010
14 years 11 months ago
2010
We consider asynchronous message-passing systems in which some links are timely and processes may crash. Each run defines a timeliness graph among correct processes: (p, q) is an e...
SIROCCO
2010
14 years 8 months ago
2010
We consider the problem of exploring an anonymous unoriented ring of size n by k identical, oblivious, asynchronous mobile robots, that are unable to communicate, yet have the abil...
SIROCCO
2010
14 years 11 months ago
2010
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...
SIROCCO
2010
14 years 11 months ago
2010
Abstract. This paper concerns graph spanners that approximate multipaths between pair of vertices of an undirected graphs with n vertices. Classically, a spanner H of stretch s for...