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 this page instead for the normal view: Efficient algorithms for the shortest paths and minimum spanning tree on the BSP model |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient algorithms for the shortest paths and minimum spanning tree on the BSP model |
scientific article |
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
