First Name
Khalid
Last Name
Charan
Dataset Entries from this Author
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.
- Categories:
