Shortest paths in a diagraph with an underestimated arc weight

DOI10.31926/BUT.MIF.2022.2.64.1.13OpenAlexW4286247391MaRDI QIDQ6169578

Adrian M. Deaconu, Unnamed Author, Laura Ciupală

Publication date: 14 August 2023

Published in: Bulletin of the Transilvania University of Brasov. Series III: Mathematics and Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.31926/but.mif.2022.2.64.1.13

zbMATH Keywords

shortest pathsgraph algorithmsincremental algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Directed graphs (digraphs), tournaments (05C20)

This page was built for publication: Shortest paths in a diagraph with an underestimated arc weight