Sciweavers

720 search results - page 42 / 144
» Nonrepetitive colorings of graphs
Sort
View
GECCO
2003
Springer
148views Optimization» more  GECCO 2003»
14 years 25 days ago
A Hybrid Immune Algorithm with Information Gain for the Graph Coloring Problem
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...
Vincenzo Cutello, Giuseppe Nicosia, Mario Pavone
AAIM
2008
Springer
131views Algorithms» more  AAIM 2008»
14 years 1 months ago
Approximating Maximum Edge 2-Coloring in Simple Graphs Via Local Improvement
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 ...
Zhi-Zhong Chen, Ruka Tanahashi
AAIM
2007
Springer
127views Algorithms» more  AAIM 2007»
14 years 1 months ago
An Improved Approximation Algorithm for Maximum Edge 2-Coloring in Simple Graphs
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...
Zhi-Zhong Chen, Ruka Tanahashi
SIBGRAPI
2006
IEEE
14 years 1 months ago
A Computer-Assisted Colorization Algorithm based on Topological Difference
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...
Hedlena M. de A. Bezerra, Bruno Feijó, Luiz...
JCST
2008
85views more  JCST 2008»
13 years 7 months ago
A General Approach to L ( h, k )-Label Interconnection Networks
d Abstract) Tiziana Calamoneri 1 , Saverio Caminiti 2 , and Rossella Petreschi 3 Dipartimento di Informatica Universit`a degli Studi di Roma "La Sapienza" Via Salaria 113...
Tiziana Calamoneri, Saverio Caminiti, Rossella Pet...