A decomposition approach to solve the selective graph coloring problem in some perfect graph families
Sign Up to like & getrecommendations! Published in 2019 at "Networks"
DOI: 10.1002/net.21850
Abstract: Graph coloring is the problem of assigning a minimum number of colors to all vertices of a graph such that no two adjacent vertices receive the same color. The selective graph coloring problem is a… read more here.
Keywords: graph; perfect graph; coloring problem; problem ... See more keywords
Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem
Sign Up to like & getrecommendations! Published in 2021 at "Algorithmica"
DOI: 10.1007/s00453-021-00838-3
Abstract: We contribute to the theoretical understanding of randomized search heuristics for dynamic problems. We consider the classical vertex coloring problem on graphs and investigate the dynamic setting where edges are added to the current graph.… read more here.
Keywords: search; time; randomized search; coloring problem ... See more keywords
Polynomial-time approximation algorithms for the coloring problem in some cases
Sign Up to like & getrecommendations! Published in 2017 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-016-0008-x
Abstract: We consider the coloring problem for hereditary graph classes, i.e. classes of simple unlabeled graphs closed under deletion of vertices. For the family of the hereditary classes of graphs defined by forbidden induced subgraphs with… read more here.
Keywords: coloring problem; time approximation; polynomial time; problem ... See more keywords
A new oscillator coupling function for improving the solution of graph coloring problem
Sign Up to like & getrecommendations! Published in 2020 at "Physica D: Nonlinear Phenomena"
DOI: 10.1016/j.physd.2020.132617
Abstract: Abstract Conventional Boolean computational methods are inefficient in solving complex combinatorial optimization problems such as graph coloring or traveling sales man problem. In contrast, the dynamics of coupled oscillators could efficiently be used to find… read more here.
Keywords: coupling function; graph coloring; coloring problem; solution graph ... See more keywords
An Improved Local Search Genetic Algorithm with a New Mapped Adaptive Operator Applied to Pseudo-Coloring Problem
Sign Up to like & getrecommendations! Published in 2020 at "Symmetry"
DOI: 10.3390/sym12101684
Abstract: In many situations, an expert must visually analyze an image arranged in grey levels. However, the human eye has strong difficulty in detecting details in this type of image, making it necessary to use artificial… read more here.
Keywords: pseudo coloring; search; local search; genetic algorithm ... See more keywords