A lower bound on the permanent of a $(0,\,1)$-matrix
1973; American Mathematical Society; Volume: 39; Issue: 1 Linguagem: Inglês
10.1090/s0002-9939-1973-0313265-5
ISSN1088-6826
Autores Tópico(s)Markov Chains and Monte Carlo Methods
ResumoThe paper gives a lower bound for the permanent of a fully indecomposable $(0,1)$-matrix with at least $k$ ones in each row. The result extends those of H. Minc and P. Gibson.
Referência(s)