计算机工程2012，Vol.38Issue(3)：265-266,269,3.DOI:10.3969/j.issn.1000-3428.2012.03.087
基于二部图的公共交通网络模型
Public Transport Network Model Based on Bipartite Graph
摘要
Abstract
Some of the modeling methods are not very suitable to establish the model of public transport network of Lanzhou for the reason that the real parameters of the network cannot be got or the method is with high self-complexity. A model based on bipartite graph is proposed, in which, the bus number as the "top set", the station as the "bottom set", public transport network model of Lanzhou is built. A lot of data are computed and analyzed, which indicates that this network fits with small-world and scale-free network, and analyzes the performance and connectivity with the maximum value of connected subgraph and Laplacian spectrum. Result proves that the use of bipartite graph to express, analyze and calculate the complex network not only guarantees the calculation result when the storage space drops relatively, but also seems direct-viewing and simple when optimizing the complex network on the bipartite graph.关键词
复杂网络/二部图/公共交通网络/无标度网络/小世界/网络故障Key words
complex network/ bipartite graph/ public transport network/ scale-free network/ small-world/ network fault分类
信息技术与安全科学引用本文复制引用
卢鹏丽,贾春旭,沈万里..基于二部图的公共交通网络模型[J].计算机工程,2012,38(3):265-266,269,3.基金项目
甘肃省自然科学基金资助项目(0809RJZA017) （0809RJZA017）
兰州理工大学校基金资助项目(0914ZX136) （0914ZX136）
