TY  - JOUR
ID  - Harant2019
LB  - Harant2019
AU  - Harant, Jochen
AU  - Jendrol', Stanislav
TI  - Lightweight paths in graphs
ST  - Lightweight paths in graphs
JO  - Opuscula Math.
JA  - Opuscula Math.
JF  - Opuscula Mathematica
PY  - 2019
VL  - 39
IS  - 6
SP  - 829
EP  - 837
DO  - https://doi.org/10.7494/OpMath.2019.39.6.829
UR  - https://doi.org/10.7494/OpMath.2019.39.6.829
AB  - Let \(k\) be a positive integer, \(G\) be a graph on \(V(G)\) containing a path on \(k\) vertices, and \(w\) be a weight function assigning each vertex \(v\in V(G)\) a real weight \(w(v)\). Upper bounds on the weight \(w(P)=\sum_{v\in V(P)}w(v)\) of \(P\) are presented, where \(P\) is chosen among all paths of \(G\) on \(k\) vertices with smallest weight.
KW  - weighted graph
KW  - lightweight path
SN  - 1232-9274
ER  -