Author:
KOBAYASHI Shun-ichi,NAKAYAMA Shoichiro,WAKABAYASHI Keita,TSUBOKAWA Shutaro
Publisher
Japan Society of Civil Engineers
Reference5 articles.
1. 4) Dijkstra, E.W.: A note on two problems in connexion with graphs, Numerische Mathematik, Vol. 1, pp. 269-271. 1959.
2. 5) Fredman, M.L. & Tarjan, R.E.: Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms, Journal of the Association for Computing Machinery, Vol. 34, No. 3, pp. 596-615, 1987.
3. 6) Chan, Y.: A Method to Simplify Network Representation in Transportation Planning, Transportation Research, Vol.10, pp.179-191, 1976.
4. 9) Connors, R. D. and Watling, D. P.: Aggregation of Traffic Networks Using Sensitivity Analysis, UTSG, 2A1.1-2A1.11, 2008.
5. 14) Fiedler, M.: Algebraic connectivity of graphs, Czechoslovak Mathematical Journal, Vol. 25, pp. 298-305, 1973.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. MEASUREMENT OF THE ROAD NETWORK CONNECTIVITY AND ITS REINFORCEMENT OPTIMIZATION PROBLEM;Journal of Japan Society of Civil Engineers, Ser. D3 (Infrastructure Planning and Management);2021