An Investigation of the DIJKSTRA's and BELLMAN-FORD's algorithm as solutions to the shortest-path problem Andrea Estrella C. Gracia
Material type: TextPublication details: 2010Description: x, 43 leaves 28 cmItem type | Home library | Call number | Status | Notes | Date due | Barcode |
---|---|---|---|---|---|---|
Thesis/Dissertation | REF | Available | Library Use only | 591 |
Thesis (M.S. Math) -- Mariano Marcos State University, Laoag City
Bibliography: leaves 42-43
There are no comments on this title.