Empirical analysis of algorithms for the shortest negative cost cycle problem (Q1634773)
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 6994890
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Empirical analysis of algorithms for the shortest negative cost cycle problem |
scientific article; zbMATH DE number 6994890 |
Statements
Empirical analysis of algorithms for the shortest negative cost cycle problem (English)
0 references
18 December 2018
0 references
graph theory
0 references
single source shortest path
0 references
path width
0 references
cycle
0 references
distinct edge width
0 references
0 references
0.8712592124938965
0 references
0.7852941155433655
0 references
0.7846227288246155
0 references
0.7772943377494812
0 references
0.7756917476654053
0 references
