  The minimum rank of a graph is the minimum possible rank of a real matrix
whose zero-nonzero pattern is described by the graph. The current algorithms
can compute efficiently the minimum rank of undirected trees. This paper
provides an algorithm to compute in polynomial time the minimum rank of
directed trees allowing loops.
