A quick method for finding shortest pairs of disjoint paths (Q3330991)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A quick method for finding shortest pairs of disjoint paths |
scientific article |
Statements
A quick method for finding shortest pairs of disjoint paths (English)
0 references
1984
0 references
directed graph
0 references
distinguished source
0 references
pair of edge-disjoint paths
0 references
minimum total edge cost
0 references
