Permuting matrices to avoid forbidden submatrices (Q1894366)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Permuting matrices to avoid forbidden submatrices
scientific article

    Statements

    Permuting matrices to avoid forbidden submatrices (English)
    0 references
    0 references
    0 references
    0 references
    23 April 1996
    0 references
    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.
    0 references
    permuting matrices
    0 references
    forbidden submatrices
    0 references
    \((0,1)\)-matrices
    0 references
    algorithmic complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers