Mathematics – Combinatorics
Scientific paper
2012-04-06
Mathematics
Combinatorics
15 pages
Scientific paper
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.
Delvenne Jean-Charles
Trefois Maguy
No associations
LandOfFree
Computing the minimum rank of a loop directed tree does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Computing the minimum rank of a loop directed tree, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing the minimum rank of a loop directed tree will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-183590