A new algorithm for the shortest‐path problem
From MaRDI portal
Publication:5226586
DOI10.1002/NET.21870zbMath1418.90273OpenAlexW2905964455MaRDI QIDQ5226586
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
shortest pathscombinatorial algorithmslabeling methodsnegative cyclespractical efficiencyadmissible graph
This page was built for publication: A new algorithm for the shortest‐path problem