Obtaining a Triangular Matrix by Independent Row-Column Permutations - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

Obtaining a Triangular Matrix by Independent Row-Column Permutations

Résumé

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.
Fichier principal
Vignette du fichier
article.pdf (411.76 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01189621 , version 1 (01-09-2015)

Identifiants

Citer

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. ⟨10.1007/978-3-662-48971-0_15⟩. ⟨hal-01189621⟩
160 Consultations
1446 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More