5922 search results - page 214 / 1185 » Navigability of Complex Networks |
122
click to vote
MASCOTS
2001
15 years 4 months ago
2001
We introduce a routing mechanism, referred to as algorithmic routing. It is a viable routing alternative for network simulations with minimal space complexity
135
click to vote
SPAA
2010
ACM
15 years 8 months ago
2010
ACM
Partitioning is the dominant technique to transmit large files in peer-to-peer networks. A peer can redistribute each part immediately after its download. BitTorrent combines thi...
128
click to vote
ITSL
2008
15 years 4 months ago
2008
In this paper we present a randomized complexity theoretic model for those epidemics propagated via short-distance close contact. We prove that the contact-based epidemics problems...
126
click to vote
ECAL
2007
Springer
15 years 9 months ago
2007
Springer
In this paper1 , we introduce a method, Assortative Preferential Attachment, to grow a scale-free network with a given assortativeness value. Utilizing this method, we investigate ...
104
click to vote
ISAAC
2005
Springer
15 years 8 months ago
2005
Springer
We study network load games, a class of routing games in networks which generalize selfish routing games on networks consisting of parallel links. In these games, each user aims t...