Computing the minimum rank of a loop directed tree
From MaRDI portal
Publication:6232136
arXiv1204.1444MaRDI QIDQ6232136FDOQ6232136
Jean-Charles Delvenne, Maguy Trefois
Publication date: 6 April 2012
Abstract: 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.
This page was built for publication: Computing the minimum rank of a loop directed tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6232136)
