145 search results - page 13 / 29 » Strong Colorings of Hypergraphs |
107
click to vote
ICIP
2008
IEEE
15 years 11 months ago
2008
IEEE
People re-detection aims at performing re-identification of people who leave the scene and reappear after some time. This is an important problem especially in video surveillance ...
DAGSTUHL
2006
14 years 11 months ago
2006
We consider the computational complexity of producing the best possible offspring in a crossover, given two solutions of the parents. The crossover operators are studied on the cla...
ESA
2010
Springer
14 years 10 months ago
2010
Springer
abstract appeared in Proc. 24th Annual Symposium of Computational Geometry (SoCG), 2008, pp. 338-345. S. Shannigrahi and S. P. Pal, "Efficient Prufer-like Coding and Counting ...
DM
2008
14 years 9 months ago
2008
The present paper continues the study (begun by Quattrocchi, Colouring 4-cycle systems with specified block colour pattern: the case of embedding P3-designs, Electron. J. Combin.,...
78
Voted
DM
2006
14 years 9 months ago
2006
Let F1, F2, . . . , Fk be graphs with the same vertex set V . A subset S V is a factor dominating set if in every Fi every vertex not in S is adjacent to a vertex in S, and a fac...