Using software complexity measures to analyze algorithms -- an experiment with the shortest-paths algorithms. (Q1413809)
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 2005372
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Using software complexity measures to analyze algorithms -- an experiment with the shortest-paths algorithms. |
scientific article; zbMATH DE number 2005372 |
Statements
Using software complexity measures to analyze algorithms -- an experiment with the shortest-paths algorithms. (English)
0 references
17 November 2003
0 references
Algorithm implementation
0 references
Software complexity measures
0 references
Shortest-path algorithms
0 references
0.7412108778953552
0 references
