Swapping a failing edge of a single source shortest paths tree is good and fast (Q1566374): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Normalize DOI. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s00453-002-0988-z / 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.1007/s00453-002-0988-z / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2007776707 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00453-002-0988-Z / rank | |||
Normal rank | |||
Latest revision as of 21:51, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Swapping a failing edge of a single source shortest paths tree is good and fast |
scientific article |
Statements
Swapping a failing edge of a single source shortest paths tree is good and fast (English)
0 references
2 June 2003
0 references
network survivability
0 references
single source shortest paths tree
0 references
swap algorithms
0 references
