An improvement of Goldberg, Plotkin and Vaidya's maximal node-disjoint paths algorithm (Q1124337)
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: Publication:1124337 |
scientific article; zbMATH DE number 4112012
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improvement of Goldberg, Plotkin and Vaidya's maximal node-disjoint paths algorithm |
scientific article; zbMATH DE number 4112012 |
Statements
An improvement of Goldberg, Plotkin and Vaidya's maximal node-disjoint paths algorithm (English)
0 references
1989
0 references
maximal paths
0 references
parallel algorithm
0 references
depth-first search
0 references
0.8527143001556396
0 references
0.8043592572212219
0 references
0.7969117164611816
0 references
0.7852228879928589
0 references
0.7797572612762451
0 references
