4913 search results - page 107 / 983 » Results and Perspectives of the G |
DM
2006
13 years 10 months ago
2006
The pair length of a graph G is the maximum positive integer k, such that the vertex set of G can be partitioned into disjoint pairs {x, x }, such that d(x, x ) k for every x V (...
APAL
2005
13 years 10 months ago
2005
We prove that if G is a group definable in a saturated o-minimal structure, then G has no infinite descending chain of type-definable subgroups of bounded index. Equivalently, G h...
COMBINATORICS
2004
13 years 10 months ago
2004
Consider random regular graphs of order n and degree d = d(n) 3. Let g = g(n) 3 satisfy (d-1)2g-1 = o(n). Then the number of cycles of lengths up to g have a distribution simila...
DM
2002
13 years 10 months ago
2002
Let H be a graph. A graph G is said to be H-free if it contains no subgraph isomorphic to H. A graph G is said to be an H-saturated subgraph of a graph K if G is an H-free subgrap...
ICCV
2009
IEEE
15 years 3 months ago
2009
IEEE
Scene appearance from the point of view of a light source
is called a reciprocal or dual view. Since there exists a large
diversity in illumination, these virtual views may be no...