A new algorithm for the shortest-path problem

DOI10.1002/NET.21870zbMATH Open1418.90273OpenAlexW2905964455MaRDI QIDQ5226586FDOQ5226586

Amr Elmasry, Ahmed Shokry

Publication date: 1 August 2019

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21870

Recommendations

• scientific article; zbMATH DE number 3937196
• scientific article; zbMATH DE number 613343
• A novel single source shortest path algorithm
• Scaling Algorithms for the Shortest Paths Problem
• scientific article; zbMATH DE number 1926665

zbMATH Keywords

shortest pathscombinatorial algorithmsnegative cyclespractical efficiencyadmissible graphlabeling methods

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85)

Cited In (11)

• A Simpler and More Efficient Algorithm for the Next-to-Shortest Path Problem
• Title not available (Why is that?)
• Efficient Algorithms for Solving the Shortest Covering Path Problem
• Title not available (Why is that?)
• Note on ``A new bidirectional algorithm for shortest paths
• A bidirectional shortest-path algorithm with good average-case behavior
• A new algorithm for reoptimizing shortest paths when the arc costs change
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A novel linear algorithm for shortest paths in networks

This page was built for publication: A new algorithm for the shortest-path problem

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