56 search results - page 8 / 12 » Distributed Computation of All Node Replacements of a Minimu... |
ENTCS
2007
13 years 7 months ago
2007
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
FUIN
2007
13 years 7 months ago
2007
Abstract. In the paper two notions related to local (distributed) computations are identified and discussed. The first one is the notion of reducible graphs. A graph is reducible...
ISCC
2005
IEEE
14 years 28 days ago
2005
IEEE
— As broadcasting is widely used for miscellaneous maintenance operations in wireless ad hoc networks, where energy is a scarce resource, an efficient broadcasting protocol is o...
SPAA
2010
ACM
14 years 5 days ago
2010
ACM
The aim of rendezvous in a graph is meeting of two mobile agents at some node of an unknown anonymous connected graph. The two identical agents start from arbitrary nodes in the g...
PODC
1989
ACM
13 years 11 months ago
1989
ACM
Two tasks of communication in a multi-hop synchronous radio network are considered: point-to-point communication and broadcast (sending a message to all nodes of a network). Effi...