An incremental linear-time algorithm for recognizing interval graphs
SIAM Journal on Computing
Approximation algorithms for hitting objects with straight lines
Discrete Applied Mathematics
Structural properties and decomposition of linear balanced matrices
Mathematical Programming: Series A and B
On the consecutive ones property
Discrete Applied Mathematics - Special volume on computational molecular biology DAM-CMB series volume 2
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 Unified Approach for Reconstructing Ancient Gene Clusters
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
A new characterization of matrices with the consecutive ones property
Discrete Applied Mathematics
Minimal Conflicting Sets for the Consecutive Ones Property in Ancestral Genome Reconstruction
RECOMB-CG '09 Proceedings of the International Workshop on Comparative Genomics
Journal of Computer and System Sciences
Approximation and fixed-parameter algorithms for consecutive ones submatrix problems
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
Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms
Discrete Optimization
Set covering with almost consecutive ones property
Discrete Optimization
Faster and simpler minimal conflicting set identification
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
| Hi-index | 0.00 |
A binary matrix has the Consecutive Ones Property (C1P) if there exists a permutation of its columns (i.e. a sequence of column swappings) such that in the resulting matrix the 1s are consecutive in every row. A Minimal Conflicting Set (MCS) of rows is a set of rows R that does not have the C1P, but such that any proper subset of R has the C1P. In [5], Chauve et al. gave a O(Δ2mmax(4,Δ+1)(n+m+e)) time algorithm to decide if a row of a m × n binary matrix with at most Δ 1s per row belongs to at least one MCS of rows. Answering a question raised in [2], [5] and [25], we present the first polynomial-time algorithm to decide if a row of a m × n binary matrix belongs to at least one MCS of rows.