376 search results - page 7 / 76 » Self-Stabilizing Graph Protocols |
CORR
2012
Springer
12 years 3 months ago
2012
Springer
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
STACS
2012
Springer
12 years 3 months ago
2012
Springer
We consider the classical rumor spreading problem, where a piece of information must be disseminated from a single node to all n nodes of a given network. We devise two simple pus...
ACSD
2005
IEEE
14 years 1 months ago
2005
IEEE
This paper presents our approach to model distributed discrete event simulation systems in the framework of distributed graph transformation. We use distributed typed attributed g...
FM
2006
Springer
13 years 11 months ago
2006
Springer
Formal modeling is a crucial first step in the analysis of safety critical communication protocols such as IP Telephony. These protocols are notoriously resistant to formal modelin...
OPODIS
2007
13 years 9 months ago
2007
Abstract. Blin et al. (2006) proposed a distributed protocol that enables the smallest number of searchers to clear any unknown asynchronous graph in a decentralized manner. Unknow...