1591 search results - page 221 / 319 » Random lifts of graphs |
128
click to vote
TIT
2010
14 years 11 months ago
2010
Small-world networks are networks in which the graphical diameter of the network is as small as the diameter of random graphs but whose nodes are highly clustered when compared wit...
142
Voted
STOC
2006
ACM
15 years 11 months ago
2006
ACM
We show that for any constant ε > 0, there is no Ω(log1−ε M)approximation algorithm for the directed congestion minimization problem on networks of size M unless NP ⊆ Z...
118
Voted
ICMCS
2005
IEEE
15 years 10 months ago
2005
IEEE
In this paper, we propose a butterfly-graph based stream authentication scheme for lossy networks where the streaming packets could be lost in both random and burst ways. Due to t...
127
Voted
AIRWEB
2005
Springer
15 years 10 months ago
2005
Springer
We study the impact of collusion –nepotistic linking– in a Web graph in terms of Pagerank. We prove a bound on the Pagerank increase that depends both on the reset probability...
121
Voted
CSCLP
2005
Springer
15 years 10 months ago
2005
Springer
This paper presents an attempt to construct a ”practical” CSP algorithm that assigns a variable with 2 values at every step. Such a strategy has been successfully used for cons...