1749 search results - page 6 / 350 » Conditional colorings of graphs |
DAM
2006
13 years 7 months ago
2006
In a previous work, we proposed a new integer programming formulation for the graph coloring problem which, to a certain extent, avoids symmetry. We studied the facet structure of...
ENDM
2006
13 years 7 months ago
2006
Greedy algorithm sometimes uses more than (G) colors while coloring a graph G. A greedy defining set is an object to eliminate these extra colors so that the greedy coloring resul...
DAM
2002
13 years 7 months ago
2002
In K(n, n) with edges colored either red or blue, we show that the problem of finding a solution matching, a perfect matching consisting of exactly r red edges, and (n - r) blue e...
WAOA
2004
Springer
14 years 21 days ago
2004
Springer
Abstract. A strong vertex coloring of a hypergraph assigns distinct colors to vertices that are contained in a common hyperedge. This captures many previously studied graph colorin...
ICCV
2009
IEEE
14 years 11 months ago
2009
IEEE
Many applications in computer vision require comparisons
between two images of the same scene. Comparison
applications usually assume that corresponding regions in
the two image...