Abstract
The genetic programming bibliography aims to be the most complete reference of papers on genetic programming. In addition to locating publications, it contains coauthor and coeditor relationships which have not previously been studied. These reveal some similarities and differences between our field and collaborative social networks in other scientific fields.
Notes
The mean path length is the average of the shortest paths between all pairs of nodes in the graph.
References
D. J. Watts and S. H. Strogatz, “Collective dynamics of ‘small-world’ networks,” Nature, vol. 393, pp. 440–442, 1998.
M. E. J. Newman, “The structure and function of complex networks,” SIAM Review, vol. 45, pp. 167–256, 2003.
J. W. Grossman, “The evolution of the mathematical research collaboration graph,” Congressus Numerantium, vol. 158, pp. 201–212, 2002.
M. E. J. Newman, “Scientific collaboration networks. I. Network construction and fundamental results,” Phys. Rev E, vol. 64, pp. 016131, 2001.
M. E. J. Newman, “Scientific collaboration networks. II. shortest paths, weighted networks, and centrality,” Phys. Rev E, vol. 64, pp. 016132, 2001.
L. A. N. Amaral, A. Scala, M. Barthélemy, and H. E. Stanley, “Classes of small-world networks,” Proceedings of the National Academy of Sciences USA, vol. 97, p. 11149–11152, 2000.
M. E. J. Newman, “Assortative mixing in networks,” Physical Review Letters, vol. 89, p. 208701, 11 November, 2002.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Tomassini, M., Luthi, L., Giacobini, M. et al. The structure of the genetic programming collaboration network. Genet Program Evolvable Mach 8, 97–103 (2007). https://doi.org/10.1007/s10710-006-9018-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10710-006-9018-2