A note on the Consecutive Ones Submatrix problem

被引：19
|
作者：
Hajiaghayi, MT [1 ]
Ganjali, Y [1 ]
机构：
[1] Univ Waterloo, Dept Comp Sci, Waterloo, ON N2L 3G1, Canada
来源：
INFORMATION PROCESSING LETTERS | 2002年 / 83卷 / 03期
基金：
加拿大自然科学与工程研究理事会;
关键词：
computational complexity; Consecutive Ones Property; Consecutive Ones Submatrix;
D O I：
10.1016/S0020-0190(01)00325-8
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
A binary matrix has the Consecutive Ones Properly (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 valiant 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 C I P 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]. (C) 2001 Elsevier Science B.V. All rights reserved.
引用
下载
收藏
页码：163 / 166
页数：4
相关论文
共 50 条
12345