Shortest paths in digraphs of small treewidth. II: Optimal parallel algorithms (Q1274331)
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: Shortest paths in digraphs of small treewidth. II: Optimal parallel algorithms |
scientific article; zbMATH DE number 1238343
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Shortest paths in digraphs of small treewidth. II: Optimal parallel algorithms |
scientific article; zbMATH DE number 1238343 |
Statements
Shortest paths in digraphs of small treewidth. II: Optimal parallel algorithms (English)
0 references
12 January 1999
0 references
shortest path
0 references
graph theory
0 references
treewidth
0 references
parallel computing
0 references
PRAM
0 references
dynamic algorithm
0 references
0 references
0.9887295961380004
0 references
0.929452896118164
0 references
0.9205573797225952
0 references
