Computational efficiency of shortest path algorithms in C language

MaRDI QIDQ3517725zbMATH OpenFDO

Authors

Publication date 12 August 2008

Mathematics Subject Classification ID

Theory of programming languages (68N15) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40)

Recommendations

• Shortest path algorithms: A computational study with the C programming language
• Shortest paths in a lattice network: A comparative study
• A computational study of efficient shortest path algorithms
• A novel single source shortest path algorithm
• An optimal parallel algorithm for solving all-pairs shortest paths problem on circular-arc graphs

Cited in

(2)

• Shortest path algorithms: A computational study with the C programming language
• Comparison of C, Java, Python and Matlab programming languages for Fibonacci and Towers of Hanoi algorithm applications

Describes a project that uses

Uses Software

• Algorithm 360

This page was built for publication: Computational efficiency of shortest path algorithms in C language

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3517725)