Average Update Times for Fully-Dynamic All-Pairs Shortest Paths (Q3596762)
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 5500052
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Average Update Times for Fully-Dynamic All-Pairs Shortest Paths |
scientific article; zbMATH DE number 5500052 |
Statements
Average Update Times for Fully-Dynamic All-Pairs Shortest Paths (English)
0 references
29 January 2009
0 references
dynamic graph algorithms
0 references
shortest paths
0 references
average-case analysis
0 references
random graphs
0 references
0.9888960719108582
0 references
0.9032544493675232
0 references
0.8634293675422668
0 references
0.8580750226974487
0 references
0.8477064371109009
0 references
