English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

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 arrangesthe 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 consecutiveones property ($SC1P$). In this article, we consider the classical complexityand fixed-parameter tractability of $(a)$ Simultaneous Consecutive OnesSubmatrix ($SC1S$) and $(b)$ Simultaneous Consecutive Ones Editing ($SC1E$)[Oswald et al., Theoretical Comp. Sci. 410(21-23):1986-1992,\hyperref[references]{2009}] problems. We show that the decision versions of$SC1S$ and $SC1E$ problems are NP-complete. We consider the parameterizedversions of $SC1S$ and $SC1E$ problems with $d$, being the solution size, asthe parameter. Given a binary matrix $M$ and a positive integer $d$,$d$-$SC1S$-$R$, $d$-$SC1S$-$C$, and $d$-$SC1S$-$RC$ problems decide whetherthere exists a set of rows, columns, and rows as well as columns, respectively,of size at most $d$, whose deletion results in a matrix with the $SC1P$. The$d$-$SC1P$-$0E$, $d$-$SC1P$-$1E$, and $d$-$SC1P$-$01E$ problems decide whetherthere exists a set of $0$-entries, $1$-entries, and $0$-entries as well as$1$-entries, respectively, of size at most $d$, whose flipping results in amatrix with the \vspace{0.095 in} $SC1P$.

Simultaneous Consecutive Ones Submatrix and Editing Problems : Classical Complexity \& Fixed-Parameter Tractable Results