765 search results - page 69 / 153 » Graph Coloring with Rejection |
NETWORKS
2010
13 years 7 months ago
2010
Let G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1, . . . , Qq} is a partition of V into q subsets. We refer to Q1, . . . ...
APPROX
2006
Springer
14 years 15 days ago
2006
Springer
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
ICPR
2008
IEEE
14 years 10 months ago
2008
IEEE
We present a simple but efficient model for object segmentation in video scenes that integrates motion and color information in a joint probabilistic framework. Optical flow is mo...
COMBINATORICS
2006
13 years 8 months ago
2006
We prove that n+h 4 vertex guards are always sufficient to see the entire interior of an n-vertex orthogonal polygon P with an arbitrary number h of holes provided that there exis...
ICCI
1991
14 years 8 days ago
1991
The problem of coloring a set of n intervals (from the real line) with a set of k colors is studied. In such a coloring, two intersecting intervals must receive distinct colors. O...