Efficiently Computing Directed Minimum Spanning Trees

Computing a directed minimum spanning tree, called arborescence, is a fundamental algorithmic problem, although not as common as its undirected counterpart. In 1967, Edmonds discussed an elegant solution. It was refined to run in O(min(n2,m log n)) by Tarjan which is optimal for very dense and very ... View More