Heuristic methods for colouring dynamic random graphs
Many real-world operational research problems can be reformulated into static graph colouring problems. However, such problems might be better represented as dynamic graphs if their size and/or constraints change over time. In this thesis, we explore heuristics approaches for colouring dynamic rando...
| Main Author: | |
|---|---|
| Published: |
Cardiff University
2018
|
| Online Access: | https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.738408 |