1949 search results - page 25 / 390 » Random graphs on surfaces |
ARSCOM
2004
14 years 11 months ago
2004
The domatic number of a graph G is the maximum number of dominating sets into which the vertex set of G can be partitioned. We show that the domatic number of a random r-regular g...
112
click to vote
ICCV
2005
IEEE
15 years 5 months ago
2005
IEEE
We propose a general method that parameterizes general surfaces with complex (possible branching) topology using Riemann surface structure. Rather than evolve the surface geometry...
201
click to vote
ECCV
2010
Springer
15 years 5 months ago
2010
Springer
Graph matching is an essential problem in computer vision and machine learning. In this paper, we introduce a random walk view on the problem and propose a robust graph matching al...
GECCO
2006
Springer
15 years 3 months ago
2006
Springer
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
100
click to vote
WAW
2007
Springer
15 years 5 months ago
2007
Springer
The geographical threshold graph model is a random graph model with nodes distributed in a Euclidean space and edges assigned through a function of distance and node weights. We st...