Combinatorial spanning tree representations for evolutionary algorithms
The research presented in this thesis lies at the interface between two distinct' fields: combinatorial mathematics and evolutionary algorithm design. We examine a number of combinatorial spanning tree representations, and develop theoretical and empirical results to quantify the intrinsic prop...
Main Author: | Paulden, Timothy John |
---|---|
Published: |
University of Exeter
2007
|
Subjects: | |
Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.486767 |
Similar Items
-
Combinatorial algorithms
by: Wright, Colin Douglas
Published: (1990) -
Randomised algorithms for counting and generating combinatorial structures
by: Sinclair, Alistair John
Published: (1988) -
On decomposition of complete infinite graphs into spanning trees
by: King, Andrew James Howell
Published: (1990) -
Combinatorial embeddings and isotopies
by: Hudson, J. F. P.
Published: (1964) -
Topics in Combinatorial Algebra: Algorithms & Computations
by: Sieg, Richard
Published: (2017)