Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

A new algorithm for the shortest‐path problem

From MaRDI portal
Publication:5226586
Jump to:navigation, search

DOI10.1002/NET.21870zbMath1418.90273OpenAlexW2905964455MaRDI QIDQ5226586

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


zbMATH Keywords

shortest pathscombinatorial algorithmslabeling methodsnegative cyclespractical efficiencyadmissible graph


Mathematics Subject Classification ID

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








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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5226586&oldid=19837587"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 8 February 2024, at 18:14.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki