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 these have been carried out, the resulting matrix is triangular. The complexity of the problem was posed as an open question by Wilf [6] 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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Brualdi, R.A., Ryser, H.J.: Combinatorial Matrix Theory. Cambridge University Press, New York (1991)
Cook, S.A.: The complexity of theorem-proving procedures. In: Proceeding 3rd Annual ACM Symposium on Theory of Computing, pp. 151–158. ACM, New York (1971)
DasGupta, B., Jiang, T., Kannan, S., Li, M., Sweedyk, E.: On the complexity and approximation of syntenic distance. Discrete Appl. Math. 88(1–3), 59–82 (1998)
Golub, G.H., Van Loan, C.F.: Matrix Computations, 3rd edn. Johns Hopkins University Press, Baltimore and London (1996)
Hopcroft, J.E., Karp, R.M.: An \({O}(n^{2.5})\) algorithm for matching in bipartite graphs. SIAM J. Comput. 4, 225–231 (1975)
Wilf, H.S.: On crossing numbers, and some unsolved problems. In: Bollobás, B., Thomason, A. (eds.) Combinatorics, Geometry and Probability: A Tribute to Paul Erdös, pp. 557–562. Cambridge University Press (1997)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fertin, G., Rusu, I., Vialette, S. (2015). Obtaining a Triangular Matrix by Independent Row-Column Permutations. In: Elbassioni, K., Makino, K. (eds) Algorithms and Computation. ISAAC 2015. Lecture Notes in Computer Science(), vol 9472. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-48971-0_15
Download citation
DOI: https://doi.org/10.1007/978-3-662-48971-0_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-48970-3
Online ISBN: 978-3-662-48971-0
eBook Packages: Computer ScienceComputer Science (R0)