An Investigation of the DIJKSTRA's and BELLMAN-FORD's algorithm as solutions to the shortest-path problem Andrea Estrella C. Gracia

By: Garcia, Andrea Estrella CMaterial type: TextTextPublication details: 2010Description: x, 43 leaves 28 cm
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item 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.

to post a comment.

© 2023 Mariano Marcos State University. All Rights Reserved.

Powered by Koha