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 ...
This project implements six graph coloring algorithms — ranging from simple greedy heuristics to a customized, improved Genetic Algorithm (GA). The goal is to show how heuristic design strongly ...
[DEPRECATED: please see https://aalok-sathe.gitlab.io/libcolgraph for new version] // a speedy library written in C++ wrapped to provide a Python interface and a ...
Abstract This lecture is designed for Week 9 of the MH1301 Discrete Mathematics curriculum, transitioning from graph traversals to structural properties. We will define the chromatic number and ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results