2270 search results - page 44 / 454 » On the distribution of eigenvalues of graphs |
142
click to vote
WWW
2003
ACM
16 years 2 months ago
2003
ACM
We present a novel algorithm for the fast computation of PageRank, a hyperlink-based estimate of the "importance" of Web pages. The original PageRank algorithm uses the ...
127
click to vote
WPES
2006
ACM
15 years 8 months ago
2006
ACM
Connections in distributed systems, such as social networks, online communities or peer-to-peer networks, form complex graphs. These graphs are of interest to scientists in field...
IPPS
2006
IEEE
15 years 8 months ago
2006
IEEE
CORR
2004
Springer
15 years 1 months ago
2004
Springer
Wattenhofer et al. [WW04] derive a complicated distributed algorithm to compute a weighted matching of an arbitrary weighted graph, that is at most a factor 5 away from the maximu...
111
click to vote
JNW
2007
15 years 1 months ago
2007
— This paper presented a fully distributed algorithm to compute a planar subgraph of the underlying wireless connectivity graph. This work considered the idealized unit disk grap...