Hybrid Bellman-Ford-Dijkstra algorithm

DOI10.1016/j.jda.2017.01.001zbMath1364.05071OpenAlexW2570013196MaRDI QIDQ511150

Rotem Itzhak, Yefim Dinitz

Publication date: 14 February 2017

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2017.01.001

zbMATH Keywords

shortest pathgraph algorithmnegative edge

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph algorithms (graph-theoretic aspects) (05C85)

Uses Software

• Algorithm 360

Cites Work

• Unnamed Item
• Unnamed Item
• Models of greedy algorithms for graph problems
• A generalization of Dijkstra's algorithm
• (Incremental) priority algorithms
• Undirected single-source shortest paths with positive integer weights in linear time
• A Shortest Path Algorithm for Edge-Sparse Graphs
• Buckets, Heaps, Lists, and Monotone Priority Queues
• Scaling Algorithms for the Shortest Paths Problem
• Application of a Technique for Research and Development Program Evaluation
• Shortest Path Feasibility Algorithms: An Experimental Evaluation
• A Shortest Path Algorithm for Real-Weighted Undirected Graphs
• Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm
• A Note on Dijkstra's Shortest Path Algorithm

This page was built for publication: Hybrid Bellman-Ford-Dijkstra algorithm