570 search results - page 12 / 114 » On the complexity of distributed graph coloring |
CORR
2010
Springer
13 years 3 months ago
2010
Springer
We study the edge-coloring problem in the message-passing model of distributed computing. This is one of the most fundamental problems in this area. Currently, the best-known dete...
DISOPT
2010
13 years 8 months ago
2010
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...
COR
2006
13 years 8 months ago
2006
We are interested in the graph coloring problem. We propose an exact method based on a linear-decomposition of the graph. The complexity of this method is exponential according to...
MTA
2006
13 years 8 months ago
2006
Indexing and segmenting of video content by motion, color and texture has been intensively explored leading to a usual representation in a storyboard. In this paper, a novel metho...
EJC
2007
13 years 8 months ago
2007
Abstract. Given a simplicial hyperplane arrangement H and a subspace arrangement A embedded in H, we define a simplicial complex ∆A,H as the subdivision of the link of A induced...