5052 search results - page 9 / 1011 » On the Complexity of Ordered Colorings |
AAIM
2005
Springer
14 years 28 days ago
2005
Springer
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
ICIP
2007
IEEE
14 years 9 months ago
2007
IEEE
In this paper, we describe a new approach for color texture classification by use of Haralick features extracted from color co-occurrence matrices. As the color of each pixel can ...
AAAI
2008
13 years 9 months ago
2008
We consider a multiagent extension of single-agent graph coloring. Multiple agents hold disjoint autonomous subgraphs of a global graph, and every color used by the agents in colo...
PODC
2006
ACM
14 years 1 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
ENDM
2006
13 years 7 months ago
2006
Greedy algorithm sometimes uses more than (G) colors while coloring a graph G. A greedy defining set is an object to eliminate these extra colors so that the greedy coloring resul...