An Investigation of the DIJKSTRA's and BELLMAN-FORD's algorithm as solutions to the shortest-path problem
Garcia, Andrea Estrella C.
An Investigation of the DIJKSTRA's and BELLMAN-FORD's algorithm as solutions to the shortest-path problem Andrea Estrella C. Gracia - 2010 - x, 43 leaves 28 cm.
Thesis (M.S. Math) -- Mariano Marcos State University, Laoag City
Bibliography: leaves 42-43
An Investigation of the DIJKSTRA's and BELLMAN-FORD's algorithm as solutions to the shortest-path problem Andrea Estrella C. Gracia - 2010 - x, 43 leaves 28 cm.
Thesis (M.S. Math) -- Mariano Marcos State University, Laoag City
Bibliography: leaves 42-43