Repository logo

Browsing by Subject "lightweight path"

Filter results by typing the first few letters
Now showing 1 - 1 of 1
  • thumbnail.journal.alt
    Item type:Article, Access status: Open Access ,
    Lightweight paths in graphs
    (Wydawnictwa AGH, 2019) Harant, Jochen; Jendroľ, Stanislav
    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.