1949 search results - page 88 / 390 » Random graphs on surfaces |
153
click to vote
STOC
2006
ACM
16 years 4 months ago
2006
ACM
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
116
click to vote
LCN
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract—We study the performance of several search algorithms on unstructured peer-to-peer networks, both using classic search algorithms such as flooding and random walk, as w...
127
click to vote
ICPR
2006
IEEE
16 years 5 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...
115
click to vote
CORR
2010
Springer
15 years 4 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...
153
click to vote
WOWMOM
2006
ACM
15 years 10 months ago
2006
ACM
Motivated by recent surfacing viruses that can spread over the air interfaces, in this paper, we investigate the potential disastrous threat of node compromise spreading in wirele...