PT  - JOURNAL ARTICLE
AU  - Paluch, Stanislav
TI  - A Multi Label Algorithm for K Shortest Paths Problem
DP  - 2009 Sep 30
TA  - Communications - Scientific Letters of the University of Zilina
PG  - 11--14
VI  - 11
IP  - 3
AID - 10.26552/com.C.2009.3.11-14
IS  - 13354205
AB  - The paper presents an algorithm for computing k shortest walks or k shortest paths in a directed graph G  (V, A). The proposed algorithm can be applied for solving the k shortest paths problem in an undirected graph G  (V, E), too, by transforming the graph G  (V,E) to the digraph G(V, A) where the arc set A contains a couple of arcs (u,v), (v,u) for every edge {u,v} E.