Recent advances in the study of the Dandelion Code, Happy Code, and Blob Code spanning tree representations

2006 IEEE Congress on Evolutionary Computation, CEC 2006

Volumn , Issue , 2006, Pages 2111-2118

  Paulden, Tim ^a,b   Smith, David K ^b  

^a IEEE   (United Kingdom)

^b UNIVERSITY OF EXETER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

DANDELION CODES; HERITABILITY PROPERTIES; QUADRATIC-TIME ALGORITHMS; SPANNING TREES;

ENCODING (SYMBOLS); EVOLUTIONARY ALGORITHMS; GRAPH THEORY; LINEAR SYSTEMS;

DECISION TREES;

EID: 34547363023     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. C. C. Palmer and A. Kershenbaum, "Representing trees in genetic algorithms," 1994, http://citeseer.ist.psu.edu/palmer94representing.html
2. E. B. Thompson, "The application of evolutionary algorithms to spanning tree problems," Ph.D. dissertation, Exeter University, UK, 2003.
3. T. Paulden and D. K. Smith, "From the Dandelion Code to the Rainbow Code: A class of bijective spanning tree representations with linear complexity and bounded locality," IEEE Transactions on Evolutionary Computation, vol. 10(2), pp. 108-123, 2006.
4. H. Prüfer, "Neuer Beweis eines Satzes über Permutationen," Archiv der Mathematik und Physik, vol. 27, pp. 742-744, 1918.
5. E. H. Neville, "The codifying of tree-structure," Proceedings of the Cambridge Philosophical Society, vol. 49, pp. 381-385, 1953.
6. N. Deo and P. Micikevicius, "Prüfer-like codes for labeled trees," Congressus Numerantium, vol. 151, pp. 65-73, 2001.
7. N. Deo and P. Micikevicius, "A new encoding for labeled trees employing a stack and a queue," Bulletin of the Institute of Combinatorics and its Applications, vol. 34, pp. 77-85, 2002.
8. J. Gottlieb, B. A. Julstrom, G. R. Raidl, and F. Rothlauf, "Prüfer numbers: A poor representation of spanning trees for evolutionary search," IlliGAL Report Number 2001001, January 2001.
9. S. Picciotto, "How to encode a tree," Ph.D. dissertation, University of California, San Diego, 1999.
10. B. A. Julstrom, "The Blob Code: A better string coding of spanning trees for evolutionary search," Genetic and Evolutionary Computation Conference Workshop Program, Morgan Kaufmann, 2001, pp. 256-261.
11. B. A. Julstrom, "The Blob Code is competitive wiüi edge-sets in genetic algorithms for the minimum routing cost spanning tree problem," Proceedings of GECCO 2005, pp. 585-590, 2005.
12. E. B. Thompson, T. Paulden, and D. K. Smith, "The Dandelion Code: A new coding of spanning trees for genetic algorithms," to appear in IEEE Transactions on Evolutionary Computation, 2006.
13. S. Caminiti and R. Petreschi, "String coding of trees with locality and heritability," in Lecture Notes in Computer Science 3595: Proceedings of COCOON 2005, pp. 251-262, 2005.
14. G. Kreweras and P. Moszkowski, 'Tree codes that preserve increases and degree sequences," Discrete Mathematics, vol. 87(3), pp. 291-296, 1991.
15. A. Cayley, "A theorem on trees," Quarterly Journal of Mathematics, vol. 23, pp. 376-378, 1889.
16. Ö. Eǧecioǧlu and J. B. Remmel, "Bijections for Cayley trees, spanning trees, and their q-analogues," Journal of Combinatorial Theory (Series A), vol. 42, pp. 15-30, 1986.
17. G. R. Raidl and J. Gottlieb, "Empirical analysis of locality, heritability and heuristic bias in evolutionary algorithms: A case study for the multidimensional knapsack problem," Evolutionary Computation, vol. 13(4), pp. 441-475, 2005.
18. G. R. Raidl and B. A. Julsttom, "Edge-sets: An effective evolutionary coding of spanning trees," Technical report TR-186-1-01-01, September 2002, www.ads.tuwien.ac.at/publications/bib/pdf/raidl-01.pdf
19. M. Rubey, "Counting spanning trees," Diplomarbeit, Universität Wien, 2002, http://www.mat.univie.ac.at/~rubey/martin.html