A scalable parallel minimum spanning tree algorithm for catchment basin delimitation in large digital elevation models - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Concurrency and Computation: Practice and Experience Année : 2013

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

Dates et versions

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

Identifiants

Citer

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⟩
50 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More