18 résultats avec le mot-clé: 'parallel mcmc algorithm balanced graph coloring problem'
Despite these solutions are effective in producing a proper coloring, generally minimizing the number of colors, they produce highly skewed color classes, undesirable for
N/A
We develop a reduction memetic algorithm (RMA) for the graph coloring problem, a feasible and infeasible search algorithm (FISA) for the equitable coloring problem, an adaptive
N/A
A bad edge is defined as an edge connecting two vertices that have the same color. The number of bad edges is the fitness score for any chromosome. As
N/A
Based on the mixed graph coloring model and on an efficient and quick tabu search algorithm for the usual graph coloring problem, we propose a tabu search algorithm as well as
N/A
L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des
N/A
Because this problem is an NP- hard problem there is not a known deterministic efficient (polinomial) method. Non- deterministic methods are in general more efficient but an
N/A
co nsidérons comme acquise cette conviction ::e la -al eur de l'expression personnelle de l'enfant. Allons-y pour pagaille. de conso- lider les racines ancestrales.
N/A
Postulant que francophones et francophiles craignent d’être perturbés dans leurs habitudes, les deux auteurs s’appliquent à dédramatiser la nouvelle orthographe : ils insistent
N/A
In this paper, we focus on the graph coloring problem and we present such a reactive algorithm with two central processes: (i) a classical local search based on Tabu Search (TS)
N/A
There are other types of graph coloring, in particular the edge coloring problem is the problem of coloring the edges of a graph with a minimum number of colors such that no two
N/A
Propose a distributed algorithm for solving the edge coloring problem (no two adjacent edges in a graph have the same color).. Discuss practical applications of
N/A
Leopoldt’s Conjecture on the p-adic rank of the units of an algebraic number field (non vanishing of the p-adic regulator).... Four Exponentials Conjecture
N/A
REITERA al Director General su petición de que continúe la colaboración con los organis- mos de las Naciones Unidas y la comunidad internacional a fin de obtener en el sector de la
N/A
Propose a distributed algorithm for solving the edge coloring problem (no two adjacent edges in a graph have the same color)5. Execute the algorithm on the
N/A
Indeed, when a local optimum is found, the measures should help to answer if it is faster to restart from another solution in order to find a new better local optimum or, to
N/A
For some graphs like 1-perfect graphs 2 , for which the chromatic number χ(G) is equal to the size of the maximum cliques γ(G), it is possible to solve the dual problem, the
N/A
Although the coloring problem is polynomial in interval graphs (since an interval graph is a chordal graph), in [4], it is proved that the Weighted Coloring problem is strongly NP-
N/A
Although the coloring problem is polynomial in interval graphs (since an interval graph is a chordal graph), in [4], it is proved that the Weighted Coloring problem is strongly NP-
N/A