Obtaining a Triangular Matrix by Independent Row-Column Permutations - Archive ouverte HAL Access content directly
Conference Papers Year :

Obtaining a Triangular Matrix by Independent Row-Column Permutations

(1) , (1) , (2)
1
2

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.
Fichier principal
Vignette du fichier
article.pdf (411.76 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

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

Identifiers

  • HAL Id : hal-01189621 , version 1

Cite

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⟩
148 View
1191 Download

Share

Gmail Facebook Twitter LinkedIn More