论文信息 - A combinatorial problem associated with nonograms

A combinatorial problem associated with nonograms

Associated with an m × n matrix with entries 0 or 1 are the m-vector of row sums and n-vector of column sums. In this article we study the set of all pairs of these row and column sums for fixed m and n. In particular, we give an algorithm for finding all such pairs for a given m and n.

[1] R. Brualdi,et al. Combinatorial Matrix Theory: Some Special Graphs , 1991 .

[2] Richard M. Wilson,et al. A course in combinatorics , 1992 .

[3] Richard Stong,et al. On the Number of Possible Row and Column Sums of 0, 1-Matrices , 2006, Electron. J. Comb..