%0 Journal Article
%A DU Yi-man
%A WU Jian-ping
%A XIAO Yun-peng
%A XIE Feng
%A XU Ming
%T A Method of Key Node Ranking for Road Network Based on Tripartite Graph
%D 2014
%R 10.13190/j.jbupt.2014.s1.010
%J Journal of Beijing University of Posts and Telecommunications
%P 51-54
%V 37
%N s1
%X <p>A method of key node ranking for road network based on tripartite graph was proposed. The statistical information of routes and origin-destination(OD) of trips were extracted from taxi trajectories, and then a tripartite graph was built to model interrelationship among the nodes consist of trips, paths and intersections. The ratings of these nodes were synchronously calculated in an iterative process. This method not only incorporates topological structure and traffic characteristics, but also takes correlation between intersection and OD distribution into account, so network-wide key nodes can be identified accurately. Experiment verifies the validity of the method.</p>
%U https://journal.bupt.edu.cn/EN/10.13190/j.jbupt.2014.s1.010