Venkata Rao, V.; R, Sridharan - Economics, Indian Institute of Management
In a rooted acyclic graph, G, there exits, in general, several rooted (not necessarily spanning) arborscences. Depending on whether the graph has weights on nodes, on arcs, or on both, it is possible to define, with different objective functions, several different problems, each concerned with...