725 search results - page 85 / 145 » Bounding Degrees on RPL |
BMVC
1997
13 years 11 months ago
1997
A new geometrical approach in solving the shape from shading problem of Lambertian model is discussed. It is shown that this problem is bound by two local constraints through the ...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
A new random geometric graph model, the so-called secrecy graph, is introduced and studied. The graph represents a wireless network and includes only edges over which secure commun...
DM
2010
13 years 10 months ago
2010
We introduce the concept of an edge-colouring total k-labelling. This is a labelling of the vertices and the edges of a graph G with labels 1, 2, . . . , k such that the weights o...
RSA
2006
13 years 10 months ago
2006
In this paper, we prove that there exists a function k = (4 + o(1))k such that G(n, /n) contains a k-regular graph with high probability whenever > k. In the case of k = 3, it...
DNA
2006
Springer
14 years 1 months ago
2006
Springer
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...