Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs (Q396709)
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: Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs |
scientific article; zbMATH DE number 6329933
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs |
scientific article; zbMATH DE number 6329933 |
Statements
Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs (English)
0 references
13 August 2014
0 references
shortest path
0 references
negative edges
0 references
computational complexity
0 references
0 references
0 references
0 references
0.8219994306564331
0 references
0.8213533759117126
0 references
0.8110642433166504
0 references
0.808222770690918
0 references
