Stable routing under the Spanning Tree Protocol (Q613335): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Reserving Resilient Capacity in a Network / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Swapping a failing edge of a shortest paths tree by minimizing the average stretch factor / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computing all the best swap edges distributively / 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 | |||
Latest revision as of 14:40, 3 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Stable routing under the Spanning Tree Protocol |
scientific article |
Statements
Stable routing under the Spanning Tree Protocol (English)
0 references
20 December 2010
0 references
stable routing
0 references
spanning tree protocol
0 references
randomized algorithms
0 references
0 references
