Sciweavers

2270 search results - page 44 / 454
» On the distribution of eigenvalues of graphs
Sort
View
WWW
2003
ACM
16 years 7 months ago
Extrapolation methods for accelerating PageRank computations
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 ...
Sepandar D. Kamvar, Taher H. Haveliwala, Christoph...
WPES
2006
ACM
16 years 20 days ago
Private social network analysis: how to assemble pieces of a graph privately
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...
Keith B. Frikken, Philippe Golle
IPPS
2006
IEEE
16 years 23 days ago
Fast distributed graph partition and application
Bilel Derbel, Mohamed Mosbah, Akka Zemmari
CORR
2004
Springer
122views Education» more  CORR 2004»
15 years 6 months ago
Simple Distributed Weighted Matchings
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...
Jaap-Henk Hoepman
JNW
2007
104views more  JNW 2007»
15 years 6 months ago
A Distributed Graph Algorithm for Geometric Routing in Ad Hoc Wireless Networks
— 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...
Rashid Bin Muhammad