Improved shortest path algorithms by dynamic graph decomposition : a thesis submitted in partial fulfilment of the requirements for the degree of Master of Science in Computer Science and Software Engineering in the University of Canterbury /

Description

Thesis (M. Sc.)--University of Canterbury, 2006. / Typescript (photocopy). Includes bibliographical references (p. 77-79). Also available via the World Wide Web.

Links & Downloads

1. http://library.canterbury.ac.nz/etd/adt-NZCU20071025.163351

Tags

Additional Fields

Identifer	oai:union.ndltd.org:OCLC/oai:xtcat.oclc.org:OCLCNo/190871457
Date	January 2006
Creators	Tian, Lin.
Source Sets	OCLC
Language	English
Detected Language	English