Graph Coloring
Mostrando 1-12 de 12 artigos, teses e dissertações.
-
1. RELATIONSHIP BETWEEN EQUITABLE TOTAL COLORING AND RANGE COLORING IN SOME REGULAR GRAPHS
ABSTRACT This work aims to study the equitable total coloring into subfamilies of regular graphs. For this purpose, we use some relationships between equitable total coloring and range (vertex) coloring in some regular graphs. The concept of range coloring of order k was first presented by (Lozano et al., 2009). In this paper, we shows that if a regular grap
Pesqui. Oper.. Publicado em: 2016-04
-
2. Wavelength assignment using a hybrid evolutionary computation to reduce cross-phase modulation
In this paper, we propose a hybrid methodology based on Graph-Coloring and Genetic Algorithm (GA) to solve the Wavelength Assignment (WA) problem in optical networks, impaired by physical layer effects. Our proposal was developed for a static scenario where the physical topology and traffic matrix are known a priori. First, we used fixed shortest-path routin
J. Microw. Optoelectron. Electromagn. Appl.. Publicado em: 2014-06
-
3. Coloração de arestas em grafos split / Edge-coloring of split graphs
Not informed.
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 28/03/2012
-
4. Diferenciação automática de matrizes Hessianas / Automatic differentiation of hessian matrices
In the context of nonlinear programming, many algorithms boil down to the application of Newton s method to the system constituted by the first order Lagrangian conditions. The calculation of Hessian matrices is necessary in this class of solvers. Our focus is on the exact calculation, within machine precision, of Hessian matrices through automatic different
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 15/04/2011
-
5. Bases de Grobner aplicadas à k-coloração de grafos / Application of Grobner bases in graph k-coloring
Neste trabalho, estudamos a teoria das bases de Gröbner e sua aplicação ao problema da k-coloração de grafos, estabelecendo assim uma interessante conexão entre a álgebra abstrata e a matemática discreta. Fazemos também uma abordagem de caráter lúdico, traduzindo o passatempo chamado Sudoku em um problema de 9-coloração e utilizando a teoria apr
Publicado em: 2010
-
6. O metodo de geração de colunas aplicado a problemas de otimização em grafos / Column generation technique applied to graph optimization problems
In this thesis, two combinatorial optimization problems are modeled by integer linear programming and solved using the column generation technique. Both cases correspond to generalizations of classical problems in graphs that occur in many practical situations. The first, called capacitated ring-star problem is a generalization of the vehicle routing problem
Publicado em: 2009
-
7. Algoritmos para problemas de grafos com incertezas / Algorithms for fuzzy graphs problems
The graph theory is an important area of mathematical programming, it has an important role in fields such as engineering and operational research. In particular, it provides the tools to tackle network problems (e.g. allocation, shortest path, maximum flow, etc), which have applications in several sub areas of engineering (e.g. telecommunications, transport
Publicado em: 2007
-
8. Teoria de Ramsey para circuitos e caminhos / Ramsey theory for cycles and paths
The main objects of interest in this work are the Ramsey numbers for cycles and the Szemerédi regularity lemma. For graphs $L_1, \ldots, L_k$, the Ramsey number $R(L_1, \ldots,L_k)$ is the minimum integer $N$ such that for any edge-coloring of the complete graph with~$N$ vertices by $k$ colors there exists a color $i$ for which the corresponding color class
Publicado em: 2007
-
9. O problema da coloração total em classes de grafos / The total colouring problem in classes of graphs
Not informed.
Publicado em: 2006
-
10. Edge-clique graphs and the lambda-coloring problem
This paper deals with edge-clique graphs and with the lambda-coloring problem when restricted to this class. A characterization of edge-clique graphs of out-erplanar graphs is given; a complete description of edge-clique graphs of threshold graphs is presented and a linear time algorithm for lambda-coloring the edge-clique graph of a threshold graph is provi
Journal of the Brazilian Computer Society. Publicado em: 2001
-
11. Melhoramentos no algoritmo genético construtivo e novas aplicações em problemas de agrupamento / Constructivegeneticalgorithmimprovementsandnewclusteringproblemsapplications
Evolutionary Algorithms has been a research subject for decades and are based on evolving populations of possible solutions for a problem along generations. Genetic Algorithms belong to this group and many scientific works have registered their efficiency applied to combinatorial optimization problems. Recently, the Constructive Genetic Algorithm (CGA)has be
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 06/12/2000
-
12. Melhoramentos no algoritmo genético construtivo e novas aplicações em problemas de agrupamento / Constructivegeneticalgorithmimprovementsandnewclusteringproblemsapplications
Evolutionary Algorithms has been a research subject for decades and are based on evolving populations of possible solutions for a problem along generations. Genetic Algorithms belong to this group and many scientific works have registered their efficiency applied to combinatorial optimization problems. Recently, the Constructive Genetic Algorithm (CGA)has be
Publicado em: 2000