concentive ones属性测试：cut or swap
Consecutive ones property testing: cut or swap
摘要：
设C是$N个元素的有限集，R = {R_1，R_2，.，R_m}是C.族R证明了连续1性质，如果存在C的置换P使得R中的每个R_i是P的区间。已经存在几个算法来测试这个性质sum_{i=1} ^m |R_i|时间，所有涉及。我们提出了一个更简单的算法，基于一个新的分区方案。
英文摘要：
Let C be a finite set of $N elements and R = {R_1,R_2, ..,R_m} a family of M subsets of C. The family R verifies the consecutive ones property if there exists a permutation P of C such that each R_i in R is an interval of P. There already exist several algorithms to test this property in sum_{i=1}^m |R_i| time, all being involved. We present a simpler algorithm, based on a new partitioning scheme.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
