Return to search

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 /

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

Identiferoai:union.ndltd.org:OCLC/oai:xtcat.oclc.org:OCLCNo/190871457
Date January 2006
CreatorsTian, Lin.
Source SetsOCLC
LanguageEnglish
Detected LanguageEnglish

Page generated in 0.0026 seconds