1542 search results - page 91 / 309 » The metamathematics of random graphs |
109
Voted
ICPR
2006
IEEE
16 years 2 months ago
2006
IEEE
This paper exploits the properties of the commute time for the purposes of graph matching. Our starting point is the random walk on the graph, which is determined by the heat-kern...
102
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Let G = (V, E) be an undirected loopless graph with possible parallel edges and s, t V . Assume that s is labelled at the initial time step and that every labelled vertex copies i...
107
click to vote
WEA
2004
Springer
15 years 7 months ago
2004
Springer
A homogeneous set is a non-trivial, proper subset of a graph’s vertices such that all its elements present exactly the same outer neighborhood. Given two graphs, G1(V, E1), G2(V,...
134
click to vote
CIKM
2008
Springer
15 years 3 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...
108
Voted
RSA
2002
15 years 1 months ago
2002
: Suppose that independent U 0 1 weights are assigned to the d 2 n2 edges of the complete d-partite graph with n vertices in each of the d = maximal independent sets. Then the expe...