Worst-case update times for fully-dynamic all-pairs shortest paths (Q3581384)
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 5771360
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Worst-case update times for fully-dynamic all-pairs shortest paths |
scientific article; zbMATH DE number 5771360 |
Statements
Worst-case update times for fully-dynamic all-pairs shortest paths (English)
0 references
16 August 2010
0 references
0.9165242910385132
0 references
0.9032544493675232
0 references
0.8870974779129028
0 references
0.8863815665245056
0 references
0.8843300938606262
0 references
