Abstract: The classical matrix-tree theorem allows us to list the spanning trees of a graph by monomials in the expansion of the determinant of a certain matrix. We prove that in the case of ...
There are some bugs in the matrix tree theorem for non-projective parsing. Give a quick look, you will find that the matrix is not full rank.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results