ORCA
Online Research @ CardiffÂ
Browse by All Cardiff Authors
![[up]](/style/images/multi_up.png)
Up a levelNumber of items: 3.
Hardy, Bradley, Lewis, Rhyd  ORCID: https://orcid.org/0000-0003-1046-811X and Thompson, Jonathan
2018.
Tackling the edge dynamic graph colouring problem with and without future adjacency information.
Journal of Heuristics
24
, pp. 321-343.
10.1007/s10732-017-9327-z
|
|
|
Hardy, Bradley
2018.
Heuristic methods for colouring dynamic random graphs.
PhD Thesis,
Cardiff University.
Item availability restricted. |
|
|
Hardy, Bradley, Lewis, Rhyd ORCID: https://orcid.org/0000-0003-1046-811X and Thompson, Jonathan Mark
2016.
Modifying colourings between time-steps to tackle changes in dynamic random graphs.
Presented at: EvoCOP 2016: European Conference on Evolutionary Computation in Combinatorial Optimization,
Porto, Portugal,
30 March - 1 April 2016.
Published in: Chicano, Francisco, Hu, Bin and Garcia-Sanchez, Pablo eds.
Evolutionary Computation in Combinatorial Optimization: 16th European Conference, EvoCOP 2016, Porto, Portugal, March 30 – April 1, 2016, Proceedings.
Lecture Notes in Computer Science.
, vol.9595
Springer,
pp. 186-201.
10.1007/978-3-319-30698-8_13
|
|
|