A quick method for finding shortest pairs of disjoint paths (Q3330991)
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 3862963
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A quick method for finding shortest pairs of disjoint paths |
scientific article; zbMATH DE number 3862963 |
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
0.8790592551231384
0 references
0.8348197340965271
0 references
0.8306074738502502
0 references
