Obtaining a Triangular Matrix by Independent Row-Column Permutations

@inproceedings{Fertin2015ObtainingAT,
  title={Obtaining a Triangular Matrix by Independent Row-Column Permutations},
  author={Guillaume Fertin and Irena Rusu and St{\'e}phane Vialette},
  booktitle={ISAAC},
  year={2015}
}
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… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-7 of 7 references

On crossing numbers, and some unsolved problems

  • H. S. Wilf
  • In B. Bollobás and A. Thomason, editors…
  • 1997
Highly Influential
6 Excerpts

Combinatorial Matrix Theory

  • R. A. Brualdi, H. J. Ryser
  • Cambridge University Press, New York,
  • 1991
Highly Influential
4 Excerpts

The complexity of theorem-proving procedures

  • S. A. Cook
  • In Proc. 3rd Annual ACM Symposium on Theory of…
  • 1971
3 Excerpts