Single-source shortest path (SSSP) discovery, one of a shortest path problem in algorithmic graph theory, is a combinatorial optimization problem. Most propositions solving the SSSP problem rely on Dijkstra’s algorithm. Although theoretically inferior in asymptotic upper bound time complexity, Dijkstra’s algorithm Binary variant outperforms Fibonacci variant empirically, in SSSP computations for real-world datasets, especially on sparse input graphs.

Dataset Files

You must be an IEEE Dataport Subscriber to access these files. Subscribe now or login.

[1] Khalid Charan, "SSSP Problem Dataset", IEEE Dataport, 2024. [Online]. Available: http://dx.doi.org/10.21227/6ypa-2716. Accessed: Jan. 13, 2025.
@data{6ypa-2716-24,
doi = {10.21227/6ypa-2716},
url = {http://dx.doi.org/10.21227/6ypa-2716},
author = {Khalid Charan },
publisher = {IEEE Dataport},
title = {SSSP Problem Dataset},
year = {2024} }
TY - DATA
T1 - SSSP Problem Dataset
AU - Khalid Charan
PY - 2024
PB - IEEE Dataport
UR - 10.21227/6ypa-2716
ER -
Khalid Charan. (2024). SSSP Problem Dataset. IEEE Dataport. http://dx.doi.org/10.21227/6ypa-2716
Khalid Charan, 2024. SSSP Problem Dataset. Available at: http://dx.doi.org/10.21227/6ypa-2716.
Khalid Charan. (2024). "SSSP Problem Dataset." Web.
1. Khalid Charan. SSSP Problem Dataset [Internet]. IEEE Dataport; 2024. Available from : http://dx.doi.org/10.21227/6ypa-2716
Khalid Charan. "SSSP Problem Dataset." doi: 10.21227/6ypa-2716