Permuting matrices to avoid forbidden submatrices
The authors survey several known and new results on the algorithmic complexity of the problem of deciding whether the rows and columns of a matrix can be permuted in such a way that the resulting matrix \(M\) avoids all matrices in \({\mathcal F}\), a fixed set of matrices.
scientific article; zbMATH DE number 777827
scientific article