Average update times for fully-dynamic all-pairs shortest paths (Q643013)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Average update times for fully-dynamic all-pairs shortest paths |
scientific article; zbMATH DE number 5964713
| 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 5964713 |
Statements
Average update times for fully-dynamic all-pairs shortest paths (English)
0 references
27 October 2011
0 references
dynamic graph algorithms
0 references
shortest paths
0 references
average-case analysis
0 references
random graphs
0 references
0 references
0.9888960719108582
0 references
0.8870974779129028
0 references
0.8565561175346375
0 references
0.8531719446182251
0 references
0.8354108333587646
0 references
