Cite
HARVARD Citation
Do, H. et al. (n.d.). A scalable parallel minimum spanning tree algorithm for catchment basin delimitation in large digital elevation models. Concurrency and computation. pp. 1394-1409. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Do, H. et al. (n.d.). A scalable parallel minimum spanning tree algorithm for catchment basin delimitation in large digital elevation models. Concurrency and computation. pp. 1394-1409. [Online].