Normal view MARC view ISBD view

An investigation of dijkstra's and bellman-ford s algorithm as solutions to the shortest-path problem

Garcia, Andrea Estrella C.

An investigation of dijkstra's and bellman-ford s algorithm as solutions to the shortest-path problem Andrea Estrella C. Garcia - Laoag City Mariano Marcos State University 2010 - x, 43p.

Master of Science

LC Class. No.: T-00962

Place hold
Print
Add to your cart (remove)
Save record
BIBTEX Dublin Core MARCXML MARC (non-Unicode/MARC-8) MARC (Unicode/UTF-8) MARC (Unicode/UTF-8, Standard) MODS (XML) RIS ISBD
More searches

Search for this title in:
Other Libraries (WorldCat) Other Databases (Google Scholar) Online Stores (Bookfinder.com) Open Library (openlibrary.org)