This project proposes an MCTS algorithm for the weighted vertex coloring problem (WVCP) that selects local search operators during the search with hyperheuristics. scripts/generator_to_eval_ls.py (for ...
The study of graph colouring has long been a central topic in discrete mathematics, with a prominent focus on optimising the assignment of labels or colours to vertices such that adjacent vertices are ...
The graph colouring problem, a classic NP-hard challenge, is central to many practical applications such as scheduling, resource allocation and network management. Recent advances have seen the ...
Each line segment of a distance-time graph represents one part of a journey. A distance-time graph, sometimes referred to as a travel graph, is a way of representing a journey. It is helpful to have ...
Contains the class Graph() that represent a graph object with support for directed or undirected ones. There you can find nested classes graph.Node() and graph.Edge() that represent a graph's vertex ...
Abstract: 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 ...
Abstract: Graph Convolutional Neural Networks (graph CNNs) have been widely used for graph data representation and semi-supervised learning tasks. However, existing graph CNNs generally use a fixed ...