Tackling the edge dynamic graph colouring problem with and without future adjacency information
暂无分享,去创建一个
Jonathan M. Thompson | Rhyd Lewis | Bradley Hardy | Jonathan M. Thompson | Rhyd Lewis | Bradley Hardy
[1] Yolande Berbers,et al. ACODYGRA: an agent algorithm for coloring dynamic graphs , 2004 .
[2] Carlo Mannino,et al. Models and solution techniques for frequency assignment problems , 2003, 4OR.
[3] David S. Johnson,et al. The Complexity of Near-Optimal Graph Coloring , 1976, J. ACM.
[4] R. M. R. Lewis,et al. Guide to Graph Colouring: Algorithms and Applications , 2015, Texts in Computer Science.
[5] Cecilia R. Aragon,et al. Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..
[6] Jin-Kao Hao,et al. Hybrid Evolutionary Algorithms for Graph Coloring , 1999, J. Comb. Optim..
[7] Jonathan M. Thompson,et al. A wide-ranging computational comparison of high-performance graph colouring algorithms , 2012, Comput. Oper. Res..
[8] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[9] Wilhelm Erben,et al. A Grouping Genetic Algorithm for Graph Colouring and Exam Timetabling , 2000, PATAT.
[10] Christian Artigues,et al. The dynamic frequency assignment problem , 2009, Eur. J. Oper. Res..
[11] Cecilia R. Aragon,et al. Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning , 1991, Oper. Res..
[12] András Gyárfás,et al. On-line and first fit colorings of graphs , 1988, J. Graph Theory.
[13] Alain Hertz,et al. Variable space search for graph coloring , 2006, Discret. Appl. Math..
[14] Jin-Kao Hao,et al. A memetic algorithm for graph coloring , 2010, Eur. J. Oper. Res..
[15] Frank Harary,et al. Dynamic graph models , 1997 .
[16] Daniel Brélaz,et al. New methods to color the vertices of a graph , 1979, CACM.
[17] Edmund K. Burke,et al. Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems , 2009, Eur. J. Oper. Res..
[18] Jonathan M. Thompson,et al. Modifying Colourings Between Time-Steps to Tackle Changes in Dynamic Random Graphs , 2016, EvoCOP.
[19] Michael E. Saks,et al. An on-line graph coloring algorithm with sublinear performance ratio , 1989, Discret. Math..
[20] Nicolas Zufferey,et al. A graph coloring heuristic using partial solutions and a reactive tabu scheme , 2008, Comput. Oper. Res..
[21] Daniel Costa,et al. An Evolutionary Tabu Search Algorithm And The NHL Scheduling Problem , 1995 .
[22] Alain Hertz,et al. Using tabu search techniques for graph coloring , 1987, Computing.
[23] Alain Hertz,et al. A survey of local search methods for graph coloring , 2004, Comput. Oper. Res..
[24] Gregory J. Chaitin,et al. Register allocation & spilling via graph coloring , 1982, SIGPLAN '82.
[25] Rhyd Lewis,et al. Creating seating plans: a practical application , 2016, J. Oper. Res. Soc..
[26] Tanya Y. Berger-Wolf,et al. A framework for community identification in dynamic social networks , 2007, KDD '07.
[27] D. J. A. Welsh,et al. An upper bound for the chromatic number of a graph and its application to timetabling problems , 1967, Comput. J..