Using software complexity measures to analyze algorithms -- an experiment with the shortest-paths algorithms.

DOI10.1016/S0305-0548(02)00060-6zbMath1049.90142MaRDI QIDQ1413809

Jukka K. Nurminen

Publication date: 17 November 2003

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

Algorithm implementationShortest-path algorithmsSoftware complexity measures

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• Shortest paths algorithms: Theory and experimental evaluation
• A Complexity Measure
• A study of the applicability of complexity measures
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Using software complexity measures to analyze algorithms -- an experiment with the shortest-paths algorithms.