157 search results - page 12 / 32 » Online coloring of hypergraphs |
VR
2002
IEEE
15 years 3 months ago
2002
IEEE
We have developed a method for recognizing and tracking known three-dimensional objects in scene images captured from a user’s viewpoint. The method uses multiple color histogra...
DAM
2010
14 years 10 months ago
2010
We study P6-free graphs, i.e., graphs that do not contain an induced path on six vertices. Our main result is a new characterization of this graph class: a graph G is P6-free if an...
MFCS
2004
Springer
15 years 3 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...
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...
64
Voted
ESA
2010
Springer
14 years 11 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 ...