Fully dynamic shortest paths in digraphs with arbitrary arc weights (Q4820906)
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: Fully dynamic shortest paths in digraphs with arbitrary arc weights |
scientific article; zbMATH DE number 2105506
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fully dynamic shortest paths in digraphs with arbitrary arc weights |
scientific article; zbMATH DE number 2105506 |
Statements
Fully dynamic shortest paths in digraphs with arbitrary arc weights (English)
0 references
1 October 2004
0 references
output complexity
0 references
zero-length cycles
0 references
0.9635504484176636
0 references
0.8916174173355103
0 references
0.8593975901603699
0 references
