Sciweavers

1363 search results - page 60 / 273
» The road coloring problem
Sort
View
MVA
2006
430views Computer Vision» more  MVA 2006»
14 years 9 months ago
Automatic fog detection and estimation of visibility distance through use of an onboard camera
In this paper, we will present a technique for measuring visibility distances under foggy weather conditions using a camera mounted onboard a moving vehicle. Our research has focus...
Nicolas Hautière, Jean-Philippe Tarel, Jean...
ENDM
2006
96views more  ENDM 2006»
14 years 9 months ago
Exploring the complexity boundary between coloring and list-coloring
Many classes of graphs where the vertex coloring problem is polynomially solvable are known, the most prominent being the class of perfect graphs. However, the list-coloring proble...
Flavia Bonomo, Guillermo Durán, Javier Mare...
ALGORITHMICA
2010
115views more  ALGORITHMICA 2010»
14 years 9 months ago
Multi-Color Pebble Motion on Graphs
We consider a graph with n vertices, and p < n pebbles of m colors. A pebble move consists of transferring a pebble from its current host vertex to an adjacent unoccupied verte...
Gilad Goraly, Refael Hassin
CCCG
2010
14 years 11 months ago
Approximating the independent domatic partition problem in random geometric graphs - an experimental study
We investigate experimentally the Domatic Partition (DP) problem, the Independent Domatic Partition (IDP) problem and the Idomatic partition problem in Random Geometric Graphs (RG...
Dhia Mahjoub, Angelika Leskovskaya, David W. Matul...
DISOPT
2010
129views more  DISOPT 2010»
14 years 10 months ago
Labeled Traveling Salesman Problems: Complexity and approximation
We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum or minimum number of co...
Basile Couëtoux, Laurent Gourvès, J&ea...