Greedy coloring - Open Access .click

Results 261 to 270 of about 129,100 (297)

Some of the next articles are maybe not open access.

Combining Reinforcement Learning and Heuristic Optimization: A Model Based on a Deep Q-Network and Graph Neural Networks for Graph Coloring

Digital Signal Processing and Signal Processing Education Workshop
We present a hybrid approach combining Reinforcement Learning (RL) with the TabuCol, which is a version of tabu search specifically designed for the Graph Coloring Problem (GCP), enhanced by Graph Neural Networks (GNNs), to tackle the GCP.
SeokJin Kwon, Yong-Hyuk Kim
semanticscholar +1 more source

GRUNDY EDGE COLORING OF SHADOW GRAPH OF SOME GRAPHS

International Journal of Applied Mathematics
An edge coloring of a graph G refers to the process of assigning colors to the edges such that any two edges sharing a common vertex receive different colors.
K. Annathurai
semanticscholar +1 more source

Greedy Localization and Color-Coding: Improved Matching and Packing Algorithms

2006
Matching and packing problems have formed an important class of NP-hard problems. There have been a number of recently developed techniques for parameterized algorithms for these problems, including greedy localization, color-coding plus dynamic programming, and randomized divide-and-conquer.
Yang Liu +3 more
openaire +1 more source

A last-fit greedy coloring algorithm for interval graphs