5 search results - page 1 / 1 » Parsimonious flooding in dynamic graphs |
PODC
2009
ACM
14 years 5 months ago
2009
ACM
PERCOM
2006
ACM
14 years 4 months ago
2006
ACM
A recent flooding algorithm [1] guaranteed correctness for networks with dynamic edges and fixed nodes. The algorithm provided a partial answer to the highly dynamic network (HDN)...
GLOBECOM
2006
IEEE
13 years 11 months ago
2006
IEEE
Flooding and random walk (RW) are the two typical search algorithms in unstructured peer-to-peer networks. The flooding algorithm searches the network aggressively. It covers the m...
PKDD
2009
Springer
13 years 12 months ago
2009
Springer
We propose a new, recursive model to generate realistic graphs, evolving over time. Our model has the following properties: it is (a) flexible, capable of generating the cross pro...
KAIS
2010
13 years 3 months ago
2010
In systems of interacting entities such as social networks, interactions that occur regularly typically correspond to significant, yet often infrequent and hard to detect, interact...