A note on the consecutive ones submatrix problem

Authors:
Mohammad Taghi Hajiaghayi;Yashar Ganjali
Affiliations:
Department of Computer Science, University of Waterloo, Waterloo, ON, Canada N2L 3GI;Department of Computer Science, University of Waterloo, Waterloo, ON, Canada N2L 3GI
Venue:
Information Processing Letters
Year:
2002

Citing 7
Cited 5

On testing consecutive-ones property in parallel

Discrete Applied Mathematics - Special volume on computational molecular biology DAM-CMB series volume 2
On the consecutive ones property

Discrete Applied Mathematics - Special volume on computational molecular biology DAM-CMB series volume 2
Consecutive retrieval property-revisited

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

Theoretical Computer Science
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Boolean Routing

WDAG '93 Proceedings of the 7th International Workshop on Distributed Algorithms
PQ-tree algorithms.

PQ-tree algorithms.

Approximation and fixed-parameter algorithms for consecutive ones submatrix problems

Journal of Computer and System Sciences
Approximability and parameterized complexity of consecutive ones submatrix problems

TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
A faster algorithm for finding minimum tucker submatrices

CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
Approximation algorithms for the consecutive ones submatrix problem on sparse matrices

ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Hardness results on the gapped consecutive-ones property problem

Discrete Applied Mathematics

Quantified Score

Hi-index	0.90

Visualization

Abstract

A binary matrix has the Consecutive Ones Property (C1P) for columns if there exists a permutation of its rows that leaves the 1's consecutive in every column. The problem of Consecutive Ones Property for a matrix is a special variant of Consecutive Ones Submatrix problem in which a positive integer K is given and we want to know if there exists a submatrix B of A consisting of K columns of A with C1P property. This paper presents an error in the proof of NP-completeness for this problem in the reference cited in text by Garey and Johnson [Computers and Intractability, A Guide to the Theory of NP-Completeness, 1979].