Optimum branchings

Abstract

An arborescence T is a tree whose edges are directed so that each is directed toward a different node. Exactly one node of T, called the root, has no edge of T directed toward it. Let G be any directed graph with a real numerical weight on each edge. A good algorithm is described for finding in G (if there is one)a spanning arborescence, with prescribed root, whose edges have maximum (or minimum) total weight.