A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Simultaneous Consecutive Ones Submatrix and Editing Problems : Classical Complexity & Fixed-Parameter Tractable Results
[article]
2018
arXiv
pre-print
A binary matrix M has the consecutive ones property (C1P) for rows (resp. columns) if there is a permutation of its columns (resp. rows) that arranges the ones consecutively in all the rows (resp. columns). If M has the C1P for rows and columns, then M is said to have the simultaneous consecutive ones property (SC1P). In this article, we consider the classical complexity and fixed-parameter tractability of (a) Simultaneous Consecutive Ones Submatrix (SC1S) and (b) Simultaneous Consecutive Ones
arXiv:1707.00106v5
fatcat:7pxx5euhv5debcwrtfhee4umri