Normal view MARC view ISBD view

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 C Material type: Text

TextPublication details: 2010Description: x, 43 leaves 28 cm

Tags from this library: No tags from this library for this title. Log in to add tags.

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

Previous	No cover image available	No cover image available	No cover image available	No cover image available	No cover image available	No cover image available	No cover image available	Next
Previous	College teachers' practices: anchor in bridging linguistic competence	Need-based course content for english bridge program	Secondary teachers' sensitivity to the teaching of collegiate literature and their adaptation strategy	An Investigation of the DIJKSTRA's and BELLMAN-FORD's algorithm as solutions to the shortest-path problem	On the Proofs of the Basel Program	Exploring the epistemological, pedagogical, and curricular beliefs of preservice secondary science teachers on global climate change	Stylistic analysis of selected poems in world literature	Next

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.