Efficient algorithms for the shortest paths and minimum spanning tree on the BSP model (Q2704451)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1578206
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms for the shortest paths and minimum spanning tree on the BSP model |
scientific article; zbMATH DE number 1578206 |
Statements
4 July 2001
0 references
bulk synchronous parallel computation
0 references
BSP model
0 references
parallel algorithms
0 references
shortest paths
0 references
minimum spanning tree
0 references
Efficient algorithms for the shortest paths and minimum spanning tree on the BSP model (English)
0 references
0.8168262243270874
0 references
0.8016048669815063
0 references
0.7990783452987671
0 references
0.7964489459991455
0 references
