2079 search results - page 207 / 416 » Universality of random graphs |
197
click to vote
SAC
2010
ACM
16 years 1 months ago
2010
ACM
We consider self-stabilizing and self-organizing distributed construction of a spanner that forms an expander. The following results are presented. • A randomized technique to r...
130
click to vote
COCO
2007
Springer
16 years 23 days ago
2007
Springer
We present a deterministic logspace algorithm for solving S-T Connectivity on directed graphs if (i) we are given a stationary distribution of the random walk on the graph in whic...
196
click to vote
TON
2008
15 years 6 months ago
2008
Abstract--In this paper, we analyze the problem of network disconnection in the context of large-scale P2P networks and understand how both static and dynamic patterns of node fail...
160
click to vote
ICML
2006
IEEE
16 years 7 months ago
2006
IEEE
I consider the setting of transductive learning of vertex labels in graphs, in which a graph with n vertices is sampled according to some unknown distribution; there is a true lab...
157
click to vote
ICML
2003
IEEE
16 years 7 months ago
2003
IEEE
A new kernel function between two labeled graphs is presented. Feature vectors are defined as the counts of label paths produced by random walks on graphs. The kernel computation ...