Obtaining a Triangular Matrix by Independent Row-Column Permutations

Abstract : Given a square (0, 1)-matrix A, we consider the problem of deciding whether there exists a permutation of the rows and a permutation of the columns of A such that after carrying out these permutations , the resulting matrix is triangular. The complexity of the problem was posed as an open question by Wilf [7] in 1997. In 1998, DasGupta et al. [3] seemingly answered the question, proving it is NP-complete. However , we show here that their result is flawed, which leaves the question still open. Therefore, we give a definite answer to this question by proving that the problem is NP-complete. We finally present an exponential-time algorithm for solving the problem.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [5 references]  Display  Hide  Download

Contributor : Stéphane Vialette <>
Submitted on : Tuesday, September 1, 2015 - 12:32:36 PM
Last modification on : Thursday, July 5, 2018 - 2:45:56 PM
Document(s) archivé(s) le : Wednesday, April 26, 2017 - 10:57:37 AM


Files produced by the author(s)


  • HAL Id : hal-01189621, version 1


Guillaume Fertin, Irena Rusu, Stéphane Vialette. Obtaining a Triangular Matrix by Independent Row-Column Permutations. 26th International Symposium on Algorithms and Computation, Dec 2015, Nagoya, France. ⟨hal-01189621⟩



Record views


Files downloads