Swapping a failing edge of a shortest paths tree by minimizing the average stretch factor (Q2383600): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2007.03.046 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2122506411 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4325546 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3044351 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fast Algorithms for Finding Nearest Common Ancestors / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finding the upper envelope of n line segments in O(n log n) time / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Swapping a failing edge of a single source shortest paths tree is good and fast / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Efficiency of a Good But Not Linear Set Union Algorithm / rank | |||
Normal rank |
Latest revision as of 15:51, 26 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Swapping a failing edge of a shortest paths tree by minimizing the average stretch factor |
scientific article |
Statements
Swapping a failing edge of a shortest paths tree by minimizing the average stretch factor (English)
0 references
19 September 2007
0 references
network survivability
0 references
single source shortest paths tree
0 references
swap algorithms
0 references