1949 search results - page 179 / 390 » Random graphs on surfaces |
132
click to vote
COMBINATORICA
2007
15 years 4 months ago
2007
We derive a sufficient condition for a sparse graph G on n vertices to contain a copy of a tree T of maximum degree at most d on (1 − )n vertices, in terms of the expansion prop...
130
click to vote
CVPR
2004
IEEE
16 years 6 months ago
2004
IEEE
We study the problem of estimating the illuminant's direction from images of textured surfaces. Given an isotropic, Gaussian random surface with constant albedo, Koenderink an...
138
click to vote
MFCS
2004
Springer
15 years 10 months ago
2004
Springer
We study the on-line versions of two fundamental graph problems, maximum independent set and minimum coloring, for the case of disk graphs which are graphs resulting from intersect...
178
click to vote
COMBINATORICS
2006
15 years 4 months ago
2006
For undirected graphs it has been known for some time that one can bound the diameter using the eigenvalues. In this note we give a similar result for the diameter of strongly con...
145
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
A barycentric mapping of a planar graph is a plane embedding in which every internal vertex is the average of its neighbours. A celebrated result of Tutte’s [16] is that if a pl...