836 search results - page 50 / 168 » Orthogonal Colorings of Graphs |
107
click to vote
ICC
2007
IEEE
15 years 8 months ago
2007
IEEE
— This paper presents a transmission scheduling scheme in sensor networks. Each node is assigned a list of time slots to use for unicast and broadcast communication. The algorith...
131
Voted
GECCO
2003
Springer
15 years 7 months ago
2003
Springer
We present a new Immune Algorithm that incorporates a simple local search procedure to improve the overall performances to tackle the graph coloring problem instances. We character...
108
click to vote
AAIM
2008
Springer
15 years 8 months ago
2008
Springer
We present a polynomial-time approximation algorithm for legally coloring as many edges of a given simple graph as possible using two colors. It achieves an approximation ratio of ...
100
Voted
AAIM
2007
Springer
15 years 8 months ago
2007
Springer
We present a polynomial-time approximation algorithm for legally coloring as many edges of a given simple graph as possible using two colors. It achieves an approximation ratio of...
105
click to vote
SIBGRAPI
2006
IEEE
15 years 8 months ago
2006
IEEE
Region-based approaches to cel painting typically use shape similarity and topology relations between regions of consecutive animation frames. This paper presents a new colorizati...