1528 search results - page 60 / 306 » On Signatures for Communication Graphs |
CORR
2006
Springer
13 years 7 months ago
2006
Springer
We investigate a prototypical agent-based model, the Naming Game, on random geometric networks. The Naming Game is a minimal model, employing local communications that captures th...
IWINAC
2005
Springer
14 years 1 months ago
2005
Springer
A self-assembly algorithm for synchronising agents and have them arrange according to a particular graph is given. This algorithm, expressed using an ad hoc rule-based process alge...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Borrowing from concepts in expander graphs, we study the expansion properties of real-world, complex networks (e.g. social networks, unstructured peer-to-peer or P2P networks) and...
STACS
2007
Springer
14 years 1 months ago
2007
Springer
One frequently studied problem in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized b...
EOR
2008
13 years 7 months ago
2008
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...