Efficient Parallel Algorithms for Testing<i>k</i>and Finding Disjoint<i>s</i>-<i>t</i>Paths in Graphs (Q3210185)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient Parallel Algorithms for Testing<i>k</i>and Finding Disjoint<i>s</i>-<i>t</i>Paths in Graphs |
scientific article |
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
