首页 | 本学科首页   官方微博 | 高级检索  
     检索      


A combinatorial problem associated with nonograms
Authors:Jessica Benton
Institution:Department of Mathematics, University of California-San Diego, La Jolla, CA 92093-0112, United States
Abstract: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.
Keywords:Row  Column  Matrix  Partition  Dominant
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号