A novel single source shortest path algorithm
From MaRDI portal
Publication:3574290
DOI10.1080/09720529.2009.10698263zbMATH Open1209.05232OpenAlexW2163460271MaRDI QIDQ3574290FDOQ3574290
Authors: R. Umarani
Publication date: 9 July 2010
Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09720529.2009.10698263
Recommendations
- A new algorithm for the shortest-path problem
- A single-source shortest path algorithm for dynamic graphs
- A faster algorithm for the single source shortest path problem with few distinct positive lengths
- scientific article; zbMATH DE number 613343
- Undirected single-source shortest paths with positive integer weights in linear time
Cites Work
Cited In (12)
- Computing single source shortest paths using single-objective fitness
- Computational efficiency of shortest path algorithms in C language
- Title not available (Why is that?)
- A single-source shortest path algorithm for dynamic graphs
- Title not available (Why is that?)
- A new algorithm for the shortest-path problem
- The improved sliding shortest path algorithm
- Locality-based relaxation: an efficient method for GPU-based computation of shortest paths
- An algorithmic framework for the single source shortest path problem with applications to disk graphs
- A faster algorithm for the single source shortest path problem with few distinct positive lengths
- Finding the shortest path by Adhwarjee's algorithm and comparison of this powerful method with Dijkstra's algorithm
- A novel linear algorithm for shortest paths in networks
This page was built for publication: A novel single source shortest path algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3574290)