Automated verification of the parallel Bellman-Ford algorithm (Q2145339)
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: Automated verification of the parallel Bellman-Ford algorithm |
scientific article; zbMATH DE number 7543922
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Automated verification of the parallel Bellman-Ford algorithm |
scientific article; zbMATH DE number 7543922 |
Statements
Automated verification of the parallel Bellman-Ford algorithm (English)
0 references
17 June 2022
0 references
deductive verification
0 references
graph algorithms
0 references
parallel algorithms
0 references
GPU
0 references
Bellman-Ford
0 references
case study
0 references
0 references
0.7578597068786621
0 references
0.7025741338729858
0 references
0.6984859704971313
0 references
