Distributed algorithms for computing shortest pairs of disjoint paths (Q4202064): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| 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.1109/18.212275 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2102722785 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 20:25, 19 March 2024
scientific article; zbMATH DE number 404191
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Distributed algorithms for computing shortest pairs of disjoint paths |
scientific article; zbMATH DE number 404191 |
Statements
Distributed algorithms for computing shortest pairs of disjoint paths (English)
0 references
13 January 1994
0 references
disjoint paths
0 references
shortest path
0 references
