2079 search results - page 96 / 416 » Universality of random graphs |
157
click to vote
ICCTA
2007
IEEE
15 years 8 months ago
2007
IEEE
We have carried out experimental research into implicit representation of large graphs using reduced ordered binary decision diagrams (OBDDs). We experimentally show that for grap...
132
click to vote
CORR
2006
Springer
15 years 4 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...
162
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented [1] over fi...
135
click to vote
PAKDD
2009
ACM
16 years 1 months ago
2009
ACM
Many applications of social networks require relationship anonymity due to the sensitive, stigmatizing, or confidential nature of relationship. Recent work showed that the simple ...
123
click to vote
SIGECOM
2006
ACM
15 years 10 months ago
2006
ACM
We study a natural extension of classical evolutionary game theory to a setting in which pairwise interactions are restricted to the edges of an undirected graph or network. We ge...