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 ...

Graph reconfiguration and colouring problems investigate the transition between feasible solutions of a graph colouring instance. The central challenge is to determine a series of elementary vertex ...

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 ...

Abstract: The Graph Coloring Problem (GCP) is a traditional NP-hard problem that is conceptually related to the map coloring problem, which was studied extensively in the 20th century. GCP has been ...

Abstract: With the rapid development of Urban Air Mobility (UAM), efficient multi-UAV path planning is urgently needed to tackle 3D airspace utilization and flight conflict mitigation. This paper ...