RO  EN
IMCS/Publications/CSJM/Issues/CSJM v.5, n.1 (13), 1997/

An algorithm and a program for finding the minimax path tree in weighted digraphs

Authors: R. Boliac

Abstract

An algorithm for finding the minimax path tree in a weighted digraph and a program in PASCAL, which implements this algorithm, are presented in this paper.

Rodica Boliac,
Institute of Mathematics,
Academy of Sciences of Moldova,
5 Academiei str., Kishinev
2028, Moldova.
e-mail:

Fulltext

Adobe PDF document0.13 Mb