Consecutive ones property testing: cut or swap

Authors:
Mathieu Raffinot
Affiliations:
LIAFA, Université Paris Diderot-Paris 7, Paris Cedex 13, France
Venue:
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
Year:
2011

Citing 8
Cited 0

Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing

Theoretical Computer Science
Parallel algorithms for hierarchical clustering and applications to split decomposition and parity graph recognition

Journal of Algorithms
A simple test for the consecutive ones property

Journal of Algorithms
PC trees and circular-ones arrangements

Theoretical Computer Science - Computing and combinatorics
A certifying algorithm for the consecutive-ones property

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A note on computing set overlap classes

Information Processing Letters
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

Journal of Computer and System Sciences
A faster algorithm for finding minimum tucker submatrices

CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe

Quantified Score

Hi-index	0.00

Visualization

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. Several algorithms have been proposed to test this property in time O(Σi=1m|ri|), all being involved. We present a simpler algorithm, based on a new partitioning scheme.