A design method for the complex network growth model
暂无分享,去创建一个
Takashi Okamoto | Hironori Hirata | Seiichi Koakutsu | Haruki Mizuno | H. Hirata | S. Koakutsu | T. Okamoto | H. Mizuno
[1] Jian-Guo Liu,et al. Optimization of Robustness of Scale-Free Network to Random and Targeted Attacks , 2005 .
[2] Christos H. Papadimitriou,et al. On the Floyd-Warshall Algorithm for Logic Programs , 1999, J. Log. Program..
[3] N. Tokui,et al. Empirical and statistical analysis of genetic programming with linear genome , 1999, IEEE SMC'99 Conference Proceedings. 1999 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.99CH37028).
[4] J. K. Kinnear,et al. Advances in Genetic Programming , 1994 .
[5] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[6] T. Okamoto,et al. A growing complex network design method with an adaptive multi-objective genetic algorithm and an inner link restructuring method , 2012, 2012 Proceedings of SICE Annual Conference (SICE).
[7] Albert,et al. Emergence of scaling in random networks , 1999, Science.
[8] John R. Koza,et al. Genetic programming - on the programming of computers by means of natural selection , 1993, Complex adaptive systems.
[9] Takashi Okamoto,et al. A Growing Complex Network Design Method , 2011 .