A note on the Consecutive Ones Submatrix problem

A note on the Consecutive Ones Submatrix problem

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 in...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Information processing letters 2002-08, Vol.83 (3), p.163-166
Hauptverfasser: Hajiaghayi, Mohammad Taghi, Ganjali, Yashar
Format: Artikel
Sprache:eng
Schlagworte:
Algebra
Binary system
Combinatorics
Combinatorics. Ordered structures
Computational complexity
Consecutive Ones Property
Consecutive Ones Submatrix
Exact sciences and technology
Graph theory
Group theory
Group theory and generalizations
Integer programming
Linear and multilinear algebra, matrix theory
Mathematical programming
Mathematics
Matrix
Numerical analysis
Numerical analysis. Scientific computation
Numerical linear algebra
Sciences and techniques of general use
Studies
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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].
ISSN:0020-0190
1872-6119
DOI:10.1016/S0020-0190(01)00325-8