Multiple-edge-fault-tolerant approximate shortest-path trees (Q2072097)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7467498
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Multiple-edge-fault-tolerant approximate shortest-path trees |
scientific article; zbMATH DE number 7467498 |
Statements
Multiple-edge-fault-tolerant approximate shortest-path trees (English)
0 references
1 February 2022
0 references
multiple-edge fault-tolerant shortest-path tree
0 references
distance sensitivity oracle
0 references
fully-dynamic minimum spanning tree
0 references
0 references
0.9793473482131958
0 references
0.8685849905014038
0 references
0.8327605724334717
0 references
0.8305970430374146
0 references
