172 search results - page 6 / 35 » The Analysis of a List-Coloring Algorithm on a Random Graph |
CIKM
2008
Springer
13 years 9 months ago
2008
Springer
Although PageRank has been designed to estimate the popularity of Web pages, it is a general algorithm that can be applied to the analysis of other graphs other than one of hypert...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
— The automatic detection of failures in IP paths is an essential step for operators to perform diagnosis or for overlays to adapt. We study a scenario where a set of monitors se...
KDD
2007
ACM
14 years 8 months ago
2007
ACM
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
STOC
2010
ACM
14 years 15 days ago
2010
ACM
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
APPROX
2004
Springer
14 years 1 months ago
2004
Springer
The central observation of this paper is that if ǫn random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter O(ln ...