A scalable parallel minimum spanning tree algorithm for catchment basin delimitation in large digital elevation models - Archive ouverte HAL Access content directly
Journal Articles Concurrency and Computation: Practice and Experience Year : 2013

A scalable parallel minimum spanning tree algorithm for catchment basin delimitation in large digital elevation models

Dates and versions

hal-00785859 , version 1 (07-02-2013)

Identifiers

Cite

Hiep-Thuan Do, Sébastien Limet, Emmanuel Melin. A scalable parallel minimum spanning tree algorithm for catchment basin delimitation in large digital elevation models. Concurrency and Computation: Practice and Experience, 2013, 25 (10), pp.1394-1409. ⟨10.1002/cpe.2950⟩. ⟨hal-00785859⟩
52 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More