登入
選單
返回
Google圖書搜尋
A Heuristic Improvement of the Bellman-Ford Algoritm [i.e. Algorithm]
Andrew V. Goldberg
Tomasz Radzik
出版
Department of Computer Science, Stanford University
, 1993
URL
http://books.google.com.hk/books?id=ZpOEtAEACAAJ&hl=&source=gbs_api
註釋
Abstract: "We describe a new shortest paths algorithm. Our algorithm achieves the same O(nm) worst-case time bound as Bellman-Ford algorithm but is superior in practice."
