Consecutive ones property testing: cut or swap

Details Consecutive ones property testing: cut or swap Consecutive ones property testing: cut or swap

2010-08-23

arxiv.org/abs/1008.3786v1

Computer Science

Data Structures and Algorithms

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Consecutive ones property testing: cut or swap does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Consecutive ones property testing: cut or swap, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Consecutive ones property testing: cut or swap will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-465679