Open AccessShortest paths in a diagraph with an underestimated arc weight
Author(s) -
Laura Ciupală,
Adrian Deaconu,
Luciana Majercsik
Publication year - 2022
Publication title -
bulletin of the "transilvania" university of braşov. series iii, mathematics and computer science
Language(s) - English
Resource type - Journals
eISSN - 2810-2037
pISSN - 2810-2029
DOI - 10.31926/but.mif.2022.2.64.1.13
Subject(s) - digraph , shortest path problem , k shortest path routing , mathematics , shortest path faster algorithm , combinatorics , constrained shortest path first , path (computing) , yen's algorithm , euclidean shortest path , floyd–warshall algorithm , longest path problem , computer science , dijkstra's algorithm , graph , programming language