PDF下载 分享
[1]向文力.传输网络分析[J].成都信息工程大学学报,2021,36(02):162-168.[doi:10.16836/j.cnki.jcuit.2021.02.007]
 XIANG Wenli.A Coherent Approach for Transportation Network Analysis[J].Journal of Chengdu University of Information Technology,2021,36(02):162-168.[doi:10.16836/j.cnki.jcuit.2021.02.007]
点击复制

传输网络分析

参考文献/References:

[1] Fredman M L,Tarjan R E.Fibonacci heaps and their uses in improved network optimization algorithms[J].Journal of the ACM,1987,34(3):596.
[2] Gabow H N,Galil Z,Spencer T,et al.Efficient algorithms for finding Minimum Spanning Trees in undirected and directed graphs[J].Combinatorica,1986,6(2):109.
[3] Chong Kawong,Han Yijie,et al.Concurrent threads and optimal parallel Minimum Spanning Trees algorithm[J].Journal of the Association for Computing Machinery,2001,48(2).
[4] Bader David A,Cong Guojing.Fast shared-memory algorithms for computing the minimum spanning forest of sparsegraphs[J].Journal of Parallel and Distributed Computing,2006,66(11):1366-1378.
[5] Dahlhaus E,Johnson D S,Papadimitriou C H,et al.The complexity of multiterminal cuts[J].SIAM Journal on Computing,1994,23(4):864-894.
[6] Nicos Christofides.Worst-case analysis of a new heuristic for the travelling salesman problem[C].Graduate School of Industrial Administration,CMU,1976.
[7] Fredman Michael Lawrence,Tarjan Robert E.Fibonacci heaps and their uses in improved network optimization algorithms[J].25th Annual Symposium on Foundations of Computer Science.IEEE.1984.
[8] Fredman Michael Lawrence,Tarjan Robert E.Fibonacci heaps and their uses in improved network optimization algorithms[J].Journal of the Association for Computing Machinery,1987,34(3):596-615.
[9] Zhan F Benjamin,Noon Charles E.Shortest Path Algorithms:An Evaluation Using Real Road Networks[J].Transportation Science,1998,32(1):65-73.

备注/Memo

收稿日期:2020-12-29

更新日期/Last Update: 2021-04-30