Consecutive ones property testing: cut or swap
Data Structures and Algorithms
2010-08-24 v1 Discrete Mathematics
Abstract
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.
Cite
@article{arxiv.1008.3786,
title = {Consecutive ones property testing: cut or swap},
author = {Mathieu Raffinot},
journal= {arXiv preprint arXiv:1008.3786},
year = {2010}
}