Add to ORKGA matrix C is said to avoid a set F of matrices, if no matrix of F can be obtained by deleting some rows and columns of C. In this paper we consider the decision problem whether the rows and columns of a given matrix C can be permuted in such a way that the permuted matrix avoids all matrices of a given class F . At first an algorithm is stated for deciding whether C can be permuted such that it avoids a set F of 2 × 2 matrices. This approach leads to a polynomial time recognition algorithm for algebraic Monge matrices fulfilling special properties. As main result of the paper it is shown that permuted Supnick matrices can be recognized in polynomial time. Moreover, we prove that the decision problem can be solved in polynomial time, if the...
An n × m matrix A is called bottleneck Monge matrix if max{aij, ars} max{aij, arj} for all 1 i <r...
An n × m matrix A is called bottleneck Monge matrix if max{aij, ars} max{aij, arj} for all 1 i <r...
A 0,±1 matrix is balanced if it does not contain a square submatrix with two nonzero elements per ro...
A matrixC is said to avoid a set of matrices, if no matrix of can be obtained by deleting some rows ...
A matrixC is said to avoid a set of matrices, if no matrix of can be obtained by deleting some rows ...
This paper attaches a frame to a natural class of combinatorial problems and points out that this cl...
This paper attaches a frame to a natural class of combinatorial problems and points out that this cl...
This paper attaches a frame to a natural class of combinatorial problems and points out that this cl...
This paper attaches a frame to a natural class of combinatorial problems and points out that this cl...
AbstractThis paper attaches a frame to a natural class of combinatorial problems and points out that...
This paper attaches a frame to a natural class of combinatorial problems and points out that this cl...
AbstractThis paper attaches a frame to a natural class of combinatorial problems and points out that...
An n × m matrix A is called bottleneck Monge matrix if max{aij, ars} max{aij, arj} for all 1 i <r n,...
An n × m matrix A is called bottleneck Monge matrix if max{aij, ars} max{aij, arj} for all 1 i <r...
An n × m matrix A is called bottleneck Monge matrix if max{aij, ars} max{aij, arj} for all 1 i <r...
An n × m matrix A is called bottleneck Monge matrix if max{aij, ars} max{aij, arj} for all 1 i <r...
An n × m matrix A is called bottleneck Monge matrix if max{aij, ars} max{aij, arj} for all 1 i <r...
A 0,±1 matrix is balanced if it does not contain a square submatrix with two nonzero elements per ro...
A matrixC is said to avoid a set of matrices, if no matrix of can be obtained by deleting some rows ...
A matrixC is said to avoid a set of matrices, if no matrix of can be obtained by deleting some rows ...
This paper attaches a frame to a natural class of combinatorial problems and points out that this cl...
This paper attaches a frame to a natural class of combinatorial problems and points out that this cl...
This paper attaches a frame to a natural class of combinatorial problems and points out that this cl...
This paper attaches a frame to a natural class of combinatorial problems and points out that this cl...
AbstractThis paper attaches a frame to a natural class of combinatorial problems and points out that...
This paper attaches a frame to a natural class of combinatorial problems and points out that this cl...
AbstractThis paper attaches a frame to a natural class of combinatorial problems and points out that...
An n × m matrix A is called bottleneck Monge matrix if max{aij, ars} max{aij, arj} for all 1 i <r n,...
An n × m matrix A is called bottleneck Monge matrix if max{aij, ars} max{aij, arj} for all 1 i <r...
An n × m matrix A is called bottleneck Monge matrix if max{aij, ars} max{aij, arj} for all 1 i <r...
An n × m matrix A is called bottleneck Monge matrix if max{aij, ars} max{aij, arj} for all 1 i <r...
An n × m matrix A is called bottleneck Monge matrix if max{aij, ars} max{aij, arj} for all 1 i <r...
A 0,±1 matrix is balanced if it does not contain a square submatrix with two nonzero elements per ro...