Efficient Parallel Algorithms for Testing<i>k</i>and Finding Disjoint<i>s</i>-<i>t</i>Paths in Graphs (Q3210185)
From MaRDI portal
!
WARNING
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 4191127
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient Parallel Algorithms for Testing<i>k</i>and Finding Disjoint<i>s</i>-<i>t</i>Paths in Graphs |
scientific article; zbMATH DE number 4191127 |
Statements
Efficient Parallel Algorithms for Testing<i>k</i>and Finding Disjoint<i>s</i>-<i>t</i>Paths in Graphs (English)
0 references
1991
0 references
parallel algorithm
0 references
disjoint paths
0 references
0.8569968342781067
0 references
0.8205270171165466
0 references
0.8140601515769958
0 references
0.8097101449966431
0 references
0.8045417070388794
0 references
