[1]Alon U. Network motifs: Theory and experimental approaches [J]. Nature Reviews Genetics, 2007 (8): 450461.[2]Milo R, ShenOrr S, Itzkovitz S, et al. Network motifs: Simple building blocks of complex networks [J]. Science, 2002, 298(25): 824827.[3]Watts D J, Strogatz S H. Collective dynamics of “smallworld” networks [J]. Nature, 1998, 393: 440442.[4]Barabási A L, Albert R. Emergence of scaling in random networks [J]. Science, 1999, 286(15): 509512.[5]Newman M E J. Properties of highly clustered networks [J]. Physical Review E, 2003, 68: 02612117.[6]Newman M E. Assortative mixing in networks [J]. Phys Rev Lett, 2002, 89(20): 20870113.[7]Valverde S, Solé R V. Network motifs in computational graphs: A case study in software architecture [J]. Physical Review E, 2005, 72(2):02610718.[8]Yang Z, Qiao L, Jiang L. Improving the performances of part dispatching based on multiple process plans using graph theory [J]. Int J Prod Res, 1998, 36 (7): 19872003.[9]Milo R, Itzkovitz S, Kashtan N, et al. Superfamilies of evolved and designed networks[J]. Science, 2004, 303: 15381542.[10]Kumar P R. Reentrant lines, queueing systems: Theory and applications [J]. Queueing Networks, 1993, 13(1/3): 87110.[11]Dorogovtsev S N, Mendes J F F, Samukhin A N. Structure of growing networks with preferential linking [J]. Phys Rev Lett, 2000, 85 (21): 46334636. |