A faster computation of the most vital edge of a shortest path (Q1603442): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q127613489 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0020-0190(00)00175-7 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1978228527 / rank | |||
Normal rank |
Latest revision as of 11:55, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A faster computation of the most vital edge of a shortest path |
scientific article |
Statements
A faster computation of the most vital edge of a shortest path (English)
0 references
14 July 2002
0 references
graph algorithms
0 references
shortest path
0 references
most vital edge
0 references
transient failure
0 references
replacement shortest path
0 references