344 search results - page 11 / 69 » Random Walks on Colored Graphs |
SODA
2010
ACM
13 years 6 months ago
2010
ACM
We consider the following marking process (rw-rand) made by a random walk on an undirected graph G. Upon arrival at a vertex v, it marks v if unmarked and otherwise it marks a ran...
ICASSP
2010
IEEE
13 years 7 months ago
2010
IEEE
We propose an algorithm for detecting bridges and estimating geodesic distances from a set of noisy samples of an underlying manifold. Finding geodesics on a nearest neighbors gra...
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...
COLOGNETWENTE
2009
13 years 8 months ago
2009
We consider maximum properly edge-colored trees in edge-colored graphs Gc . We also consider the problem where, given a vertex r, determine whether the graph has a spanning tree r...
SODA
2003
ACM
13 years 9 months ago
2003
ACM
We study the cover time of a random walk on graphs G ∈ Gn,p when p = c log n