Mating networks in steady state genetic algorithms are scale free

GECCO 2006 - Genetic and Evolutionary Computation Conference

Volumn 2, Issue , 2006, Pages 1423-1424

  Oner, M Kivanc ^a   Garibay, Ivan I ^a   Wu, Annie S ^a  

^a UNIVERSITY OF CENTRAL FLORIDA   (United States)

Author keywords

Complex networks; Graph theory; Mating networks; Scale free

Indexed keywords

EID: 33750229932     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1143997.1144226     Document Type: Conference Paper

References (5)

1. R. Albert, H. Jeong, and A.-L. Barabasi. Diameter of the world-wide web. Nature, 401:130-131, 1999.
2. R. Albert, H. Jeong, and A.-L. Barabasi. Error and attack tolerance in complex networks. Nature, 406:378-382, 2000. by Macmillan Magazines Ltd.
3. A.-L. Barabasi and R. Albert. Emergence of scaling in random networks. Science, 286:509-512, 1999. by American Association for the Advancement of Science.
4. I. I. Garibay and A. S. Wu. Cross-fertilization between proteomics and computational synthesis. In Computational Synthesis: From Basic Building Blocks to High Level Functionality., pages 67-74, 2003.
5. H. Jeong et al. Lethality and centrality in protein networks. Nature, 411:41, 2001.