45 search results - page 2 / 9 » Coloring Weighted Series-Parallel Graphs |
93
Voted
ICALP
2011
Springer
14 years 26 days ago
2011
Springer
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
ISAAC
2004
Springer
15 years 2 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...
ICIP
2002
IEEE
15 years 11 months ago
2002
IEEE
Recent interest in region based image coding has given rise to graph coloring based partition encoding methods. These methods are based on the four color theorem for planar graphs...
MCPR2
2011
14 years 8 days ago
2011
We present a strategy that combines color and depth images to detect people in indoor environments. Similarity of image appearance and closeness in 3D position over time yield weig...
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
In this paper we present a simple colorization method that relies on nonlocal graph regularization. We introduce nonlocal discrete differential operators and a family of weighted ...