1949 search results - page 183 / 390 » Random graphs on surfaces |
132
Voted
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Abstract--Breadth First Search (BFS) and other graph traversal techniques are widely used for measuring large unknown graphs, such as online social networks. It has been empiricall...
143
click to vote
SLS
2009
Springer
15 years 11 months ago
2009
Springer
Stochastic local search algorithms can now successfully solve MAXSAT problems with thousands of variables or more. A key to this success is how effectively the search can navigate...
152
click to vote
3DIM
2007
IEEE
15 years 11 months ago
2007
IEEE
In this paper, we present a new algorithm to reconstruct 3D surfaces from an unorganized point cloud based on generalizing the MPU implicit algorithm through introducing a powerfu...
142
click to vote
INFOCOM
2011
IEEE
14 years 8 months ago
2011
IEEE
—Information dissemination in a large network is typically achieved when each user shares its own information or resources with each other user. Consider n users randomly located...
148
click to vote
ISAAC
2005
Springer
15 years 10 months ago
2005
Springer
A partition of a set of n items is a grouping of the items into k disjoint classes of equal size. Any partition can be modeled as a graph: the items become the vertices of the grap...