Verilog Implementation of a System for Finding Shortest Path by Using Floyd-Warshall Algorithm
暂无分享,去创建一个
Vijayshri Chaurasia | Ajay Somkuwar | Sachin Awasthi | Vijayshri Chaurasia | A. Somkuwar | Sachin Awasthi
[1] Stanislav G. Sedukhin,et al. Blocked All-Pairs Shortest Paths Algorithm for Hybrid CPU-GPU System , 2011, 2011 IEEE International Conference on High Performance Computing and Communications.
[2] G. Unter Rote. Path Problems in Graphs , 1989 .
[3] Shan Zhu,et al. A fast distributed optimal routing algorithm for multicommodity large data networks , 1995, Proceedings of 9th International Parallel Processing Symposium.
[4] Danny Ziyi Chen. Developing algorithms and software for geometric path planning problems , 1996, CSUR.
[5] John N. Tsitsiklis,et al. Parallel and distributed computation , 1989 .
[6] Giorgio Gallo,et al. A new algorithm to find the shortest paths between all pairs of nodes , 1982, Discret. Appl. Math..
[7] Richard Bellman,et al. ON A ROUTING PROBLEM , 1958 .
[8] Aristides Gionis,et al. Fast shortest path distance estimation in large networks , 2009, CIKM.
[9] G. Rote. Path Problems in Graphs , 1990 .
[10] Lorenz Huelsbergen,et al. A representation for dynamic graphs in reconfigurable hardware and its application to fundamental graph algorithms , 2000, FPGA '00.
[11] G. Sedukhin,et al. The Algebraic Path Problem on the Cell/B.E. Processor , 2010 .
[12] Eric W. Weisstein. Floyd-Warshall Algorithm , 2008 .
[13] John K. Antonio,et al. A Fast Distributed Shortest Path Algorithm for a Class of Hierarchically Clustered Data Networks , 1992, IEEE Trans. Computers.
[14] G. Dantzig. On the Shortest Route Through a Network , 1960 .
[15] Sean R Eddy,et al. What is dynamic programming? , 2004, Nature Biotechnology.
[16] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .
[17] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.