A quick method for finding shortest pairs of disjoint paths (Q3330991): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Robert Endre Tarjan / rank | |||
| Property / author | |||
| Property / author: Robert Endre Tarjan / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.3230140209 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2155061423 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Efficient Algorithms for Shortest Paths in Sparse Networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3048571 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3707420 / rank | |||
Normal rank | |||
Latest revision as of 12:18, 14 June 2024
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
