2Koncz N, Greenfeld J, Mouskos K. A strategy for solving static muhiple optimal path transit network problems [ J]. Journal of Transportation Engineering, 1996, 122(3 ) :218 - 225.
3Wu Q J, Hartley J. Using k-shortest paths algorithms to accommodate user preferences in the optimization of public transport travel [ C ]. The 8th Internation Conference on Application of Advanced Technologies in Transportation Engineering. US: ASCE, 2004:181 - 186.
4Newman M E J, Watts D J, Strogatz S H. Random graph models of social networks [ J]. Proc Natl Acad Sci USA99, 2002, Suppll : 2566 - 2572.
5Watts D J, Strogatz S H. Collective dynamics of small-world networks [ J ]. Nature, 1998 (393) : 440 - 442.
6Newman M E J. Scientific collaboration networks: Ⅱ. shortest paths weighted networks, and centrality [ J ]. Phys Rev E,2001, 64(1) :016132.
7Newman M E J. Scientific collaboration networks: Ⅰ. network construction and fundamental results [ J]. Phys Rev E, 2001, E 64(1) :016131.
8Guillaume J L, Latapy M. Bipartite graphs as models of complex networks [ J]. Physica A, 2006,371 (2) : 795 - 813.
