1363 search results - page 162 / 273 » The road coloring problem |
161
click to vote
JCO
2010
15 years 4 months ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
152
click to vote
MST
2010
15 years 4 months ago
2010
We study the following variant of the bin covering problem. We are given a set of unit sized items, where each item has a color associated with it. We are given an integer paramet...
123
click to vote
IPL
2006
15 years 6 months ago
2006
We show that computing the lexicographically first four-coloring for planar graphs is p 2hard. This result optimally improves upon a result of Khuller and Vazirani who prove this ...
141
click to vote
ICIP
2009
IEEE
15 years 4 months ago
2009
IEEE
We present a new method to jointly perform deblurring and colordemosaicing of RGB images. Our method is derived following an inverse problem approach in a MAP framework. To avoid ...
160
click to vote
CC
2007
Springer
16 years 15 days ago
2007
Springer
In this paper, we extend past work on Linear Scan register allocation, and propose two Extended Linear Scan (ELS) algorithms that retain the compiletime efficiency of past Linear ...