IMCS/Publications/BASM/Issues/BASM n.1 (20), 1996/

Determination of the tree of minimax paths in a weighted digraph. (Russian)

Authors: Bolyak R. I., Lozovanu Dmitrii


The problem of finding the min-max paths tree in a weighted oriented graph, which generalizes the problem of finding the minimal distance tree is considered and an algorithm for its solving with cubic complexity on the number of graph's vertices is proposed.

Institutul de Matematică Academia de Ştiinţe a Moldovei
str. Academiei 5, Chişinău, MD-2028 Moldova