Decomposition of {0,1}-Matrices
IEEE Transactions on Computers
Performance Analysis of Three Text-Join Algorithms
IEEE Transactions on Knowledge and Data Engineering
The complete optimal stars-clustering-tree problem
Discrete Applied Mathematics
Optimal hypergraph tree-realization
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
| Hi-index | 0.00 |
A $\{0,1\}$-matrix $M$ has the consecutive-retrieval property if there exists a tree $T$ such that the vertices of $T$ are indexed on the rows of $M$ and the columns of $M$ are the incidence vectors of the vertex sets of paths of $T$. If such a $T$ exists, then $T$ is a realization for $M$. In this paper, an $O(r^2c)$ algorithm is presented to determine whether a given standard, $r \times c$ matrix has the consecutive-retrieval property and, if so, to construct a realization.