coloring problem
A modified PSO with fuzzy inference system for solving the planar graph coloring problem
... Graph Coloring is one of the most important problems among combinatorial and graph theory ...graph coloring in different research areas that shows the importance of the graph coloring ...
12
Hybrid Discrete Particle Swarm Algorithm for Graph Coloring Problem
... Abstract—Graph coloring problem (GCP) is one of the most studied combinatorial optimization ...graph coloring problem, including exact algorithms and (meta-)heuristic ...continuous ...
8
Study About the Selection Algo for the Graph Coloring Problem Method
... from coloring the countries of a map, where each face is literally ...to coloring the faces of a graph embedded in the ...became coloring the vertices, and in this form it generalizes to all ...the ...
9
New variable neighborhood search method for minimum sum coloring problem on simple graphs
... sum coloring problem (MSCP) is to find a legal vertex coloring for G using colors represented by natural numbers (1, 2, ...this problem based on a new structure of ...
17
An Exact Parallel Algorithm for the Radio k-coloring Problem
... In this section, we propose an exact algorithm (Algorithm 2) which determines the radio number of a given graph with n vertices. Recall the radio k-coloring problem is NP-complete problem so ...
14
Variable Neighborhood Search for solving Bandwidth Coloring Problem
... bandwidth coloring problem (BCP) and bandwidth multicoloring problem ...vertex coloring problem and they are of a great interest from both theoretical and practical points of ...
20
Time complexity analysis of RLS and (1 + 1) EA for the edge coloring problem
... number of edges m as an upper limit for the size of the graphs. Here, we perform experiments for graphs with at most m = 512 edges. Note that this allows values of m ∈ { 4, 12, 32, 80, 192, 448 } for hypercubes, but m ∈ ...
15
COLORING OF INTUITIONISTIC FUZZY GRAPH USING 𝜶,𝜷 CUTS
... At the same time, for higher values of 𝛼 and lower values of 𝛽, there are fewer adjacent edges and less colors are needed. The intuitionistic fuzzy coloring problem consists of determining the chromatic ...
13
Cost Edge Coloring of a Cactus
... edge-coloring problem has a natural application for scheduling ...transfer problem in a computer network in which each file engages two corresponding nodes, sender and receiver, simultaneously ...
6
Complementary Graph Coloring
... Graph Coloring problem is to color vertices of a graph in such a way that no two vertices that share an edge are assigned the same ...graph coloring. Graph Coloring is a well-known NP- ...
11
Synchronizing Coloring Of A Directed Graph
... road coloring problem is synchronizing coloring of a directed finite strongly connected graph with con- stant out-degree of all its vertices if the greatest com- mon divisor of lengths of all its ...
5
Coloring of Hypergraphs
... k-edge coloring of H is an assignment of k-colors to the edges of H so that distinct intersecting edges receive different ...k-edge coloring of H. A vertex coloring of H is an assignment of k-colors ...
8
Methods for Volumetric Reconstruction of Visual Scenes
... Voxel Coloring algorithm of Seitz and Dyer [39] re- constructs the photo hull for scenes photographed by cam- eras that satisfy the ordinal visibility constraint, which re- stricts the camera placements so that ...
21
P COMPLETE PROBLEM WITH CIRCUIT AND MONOTONE CIRCUIT AND NP COMPLETENESS PEOBLEM WITH SATISFIABILITY AND 3-COLORING
... The class NP consists of all the languages for which membership can be certified to a polynomial-time algorithm. It contains many important problems not known to be in P. NP can also be defined using non-deterministic ...
13
Some results on set colorings of directed trees
... set coloring of the digraph D is an assignment (function) of distinct subsets of a finite set X of colors to the vertices of the digraph, where the color of an arc, say (u,v) is obtained by applying the set ...
9
Distance r-Coloring and Distance r-Dominator Coloring number of a graph
... a coloring scheme for the ...usual coloring scheme stipulates that adjacent nodes should not receive the same ...storage problem of chemicals where two non-compatible chemicals (two chemicals which ...
5
Hybrid Evolutionary Algorithm based solution for Register Allocation for Embedded Systems
... Register allocation has been widely addressed in literature, and many approaches have been proposed. Most of them are related to Chaitin’s [6] approach, but very few address problems raised by embedded processor’s ...
7
Generalized Voxel Coloring
... Voxel Coloring or GVC. Like two earlier solutions to the same problem, Voxel Coloring [1] and Space Carving [2], our algorithm uses voxels to model the scene and exploits the fact that surface points ...
17
Theorems on list-coloring
... When looking at plane graphs , all graphs considered will be assumed to be 2-connected. Assume otherwise, then it is possible to add edges between some pairs of vertices on the boundary of the unbounded face so that the ...
5
Diophantine approximation and coloring
... 3. Bounding chromatic number of Cayley graphs In this section we will begin to understand the connections between chromatic number, dynamical systems, and Diophantine approxima- tion. We would like to emphasize that the ...
17