Doerr, Benjamin Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Johannsen, Daniel Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Doerr, B., & Johannsen, D. (2010). Edge-based Representation Beats Vertex-based Representation in Shortest Path Problems. In M. Pelikan, & J. Branke (Eds.), Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (pp. 759-766). New York, NY: ACM. doi:10.1145/1830483.1830618.