362 search results - page 24 / 73 » A Branch-and-Cut algorithm for graph coloring |
CLEAR
2006
Springer
13 years 11 months ago
2006
Springer
We present an object detection and tracking algorithm that addresses the problem of multiple simultaneous targets tracking in realworld surveillance scenarios. The algorithm is bas...
DAM
2002
13 years 7 months ago
2002
In the strong edge coloring problem, the objective is to color the edges of the given graph with the minimum number of colors so that every color class is an induced matching. In ...
COCO
2005
Springer
14 years 1 months ago
2005
Springer
CIAC
2010
Springer
14 years 22 days ago
2010
Springer
NIPS
2008
13 years 9 months ago
2008
We show that an important and computationally challenging solution space feature of the graph coloring problem (COL), namely the number of clusters of solutions, can be accurately...