Parallel algorithm to find maximum capacity paths (Q1280957)
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 1263000
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel algorithm to find maximum capacity paths |
scientific article; zbMATH DE number 1263000 |
Statements
Parallel algorithm to find maximum capacity paths (English)
0 references
15 March 1999
0 references
message routing problems
0 references
0.6999214887619019
0 references
0.6984593868255615
0 references
