Results 11 to 20 of about 901,024 (319)
Graph Colouring Problem Based on Discrete Imperialist Competitive Algorithm [PDF]
arXiv.org, 2013 In graph theory, Graph Colouring Problem (GCP) is an assignment of colours to vertices of any given graph such that the colours on adjacent vertices are different. The GCP is known to be an optimization and NP-hard problem.
Hojjat Emami, Shahriar Lotfi
openalex +3 more sources
Application of Graph Colouring Algorithm in Course Scheduling Process
KnowbaseScheduling is a crucial aspect in every occurrence, ensuring that all processes are orderly. Gema Nusantara Bukittinggi Health Vocational School currently utilizes Microsoft Excel for managing subject scheduling, which often leads to scheduling conflicts.
Nella Lestari Borotan +3 more
doaj +3 more sources
A grouping hyper-heuristic framework: Application on graph colouring
Expert systems with applications, 2015 Anas Elhag, Ender Özcan
openalex +3 more sources
Generating a Graph Colouring Heuristic with Deep Q-Learning and Graph Neural Networks [PDF]
Learning and Intelligent Optimization, 2023 The graph colouring problem consists of assigning labels, or colours, to the vertices of a graph such that no two adjacent vertices share the same colour.
George Watkins +2 more
semanticscholar +1 more source
Approximate Graph Colouring and Crystals [PDF]
ACM-SIAM Symposium on Discrete Algorithms, 2022 We show that approximate graph colouring is not solved by any level of the affine integer programming (AIP) hierarchy. To establish the result, we translate the problem of exhibiting a graph fooling a level of the AIP hierarchy into the problem of ...
Lorenzo Ciardo, Stanislav Živný
semanticscholar +1 more source
A Greedy Technique Based Improved Approach to Solve Graph Colouring Problem [PDF]
EAI Endorsed Transactions on Scalable Information Systems, 2021 Graph colouring problem is a well-known NP-class optimization problem, studied due to a lot of applications in various real-world problems. Some of these applications are: register allocation, image processing and communication networks.
Ajay Shukla, Vishal Bharti, M. Garg
doaj +1 more source
Approximate Graph Colouring and the Hollow Shadow
Symposium on the Theory of Computing, 2023 We show that approximate graph colouring is not solved by constantly many levels of the lift-and-project hierarchy for the combined basic linear programming and affine integer programming relaxation.
Lorenzo Ciardo, Stanislav Živný
semanticscholar +1 more source
Colouring (Pr + Ps)-Free Graphs [PDF]
Algorithmica, 2020 AbstractThe k-Colouring problem is to decide if the vertices of a graph can be coloured with at most k colours for a fixed integer k such that no two adjacent vertices are coloured alike. If each vertex u must be assigned a colour from a prescribed list $$L(u)\subseteq \{1,\ldots ,k\},$$ L (
Tereza Klimošová +5 more
openaire +8 more sources
Two-Step Colouring of Grid Graphs of Different Types
Моделирование и анализ информационных систем, 2022 In this article, we consider the NP-hard problem of the two-step colouring of a graph. It is required to colour the graph in a given number of colours in a way, when no pair of vertices has the same colour, if these vertices are at a distance of 1 or 2 ...
Alexander Valeryevich Smirnov
doaj +1 more source
Tackling the edge dynamic graph colouring problem with and without future adjacency information [PDF]
Journal of Heuristics, 2017 Bradley Hardy +2 more
openalex +2 more sources