Minimal paths on ordered graphs

Rok, strany: 2006, 23 - 31

To present the decision maker's (DM) preferences in multicriteria decision problems as a partially ordered set is an effective method to catch the DM's purpose and avoid misleading results. Since our paper is focused on minimal path problems, we regard the ordered set of edges $(E,≤)$. Minimal paths are defined in respect to power-ordered sets, which provides an essential tool to solve such problems. An algorithm to detect minimal paths on a multicriteria minimal path problem is presented.

ISO 690:

Bossong, U., Schweigert, D. 2006. Minimal paths on ordered graphs. In Mathematica Slovaca, vol. 56, no.1, pp. 23-31. 0139-9918.

APA:

Bossong, U., Schweigert, D. (2006). Minimal paths on ordered graphs. Mathematica Slovaca, 56(1), 23-31. 0139-9918.