Computing the minimum rank of a loop directed tree
| Autor: | Trefois, Maguy, Delvenne, Jean-Charles |
|---|---|
| Rok vydání: | 2012 |
| Předmět: | |
| Druh dokumentu: | Working Paper |
| Popis: | 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. Comment: This paper has been withdrawn due to a crucial error in Lemma 5.2. A correct and more complete version is available here: arXiv:1405.6222. In particular, in this new version we identify a class of directed trees allowing loops whose minimum rank is computable in linear time. An efficient algorithm for the minimum rank of any directed tree allowing loops is still needed |
| Databáze: | arXiv |
| Externí odkaz: |
|