1591 search results - page 35 / 319 » Random lifts of graphs |
77
Voted
WSCG
2004
15 years 2 months ago
2004
We present a camera calibration system that is simple to use and offers generality in the positioning of the cameras. This makes it very suitable for the calibration of mobile, sy...
107
Voted
DISOPT
2006
15 years 24 days ago
2006
While it was known for a long time how to transform an asymmetric traveling salesman problem on the complete graph with n vertices into a symmetric traveling salesman problem on a...
111
click to vote
COMBINATORICS
2006
15 years 24 days ago
2006
A proper edge colouring of a graph is neighbour-distinguishing if for all pairs of adjacent vertices v, w the set of colours appearing on the edges incident with v is not equal to...
118
Voted
JCT
2010
14 years 11 months ago
2010
We call a coloring of the edge set of a graph G a b-bounded coloring if no color is used more than b times. We say that a subset of the edges of G is rainbow if each edge is of a ...
106
click to vote
RSA
2006
15 years 21 days ago
2006
Motivated by a problem that arises in the study of mirrored storage systems, we describe, for any fixed , > 0 and any integer d 2, explicit or randomized constructions of d-r...