Consecutive ones property testing: cut or swap
Abstract
Let C be a finite set of $N elements and R = R1,R2, ..,Rm 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 Ri in R is an interval of P. There already exist several algorithms to test this property in sumi=1m |Ri| time, all being involved. We present a simpler algorithm, based on a new partitioning scheme.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.