1749 search results - page 34 / 350 » Conditional colorings of graphs |
SIAMDM
2008
13 years 8 months ago
2008
We first show that for any bipartite graph H with at most five vertices, there exists an on-line competitive algorithm for the class of H-free bipartite graphs. We then analyze th...
ROBOCUP
2007
Springer
14 years 2 months ago
2007
Springer
In this article we present an automatic on-line color calibration system that makes extensive use of the spatial relationships between color classes in the color space. First, we i...
ISAAC
2004
Springer
14 years 1 months ago
2004
Springer
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...
IPL
2000
13 years 8 months ago
2000
In this paper we study the performance of a particular on-line coloring algorithm, the First-Fit or Greedy algorithm, on a class of perfect graphs namely the permutation graphs. W...
DAM
2006
13 years 8 months ago
2006
Given a rectangular array where entries represent the pixels of a digitalized image, we consider the problem of reconstructing an image from the number of occurrences of each colo...