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}
}

• Guillaume Fertin, Irena Rusu, Stéphane Vialette
• Published in ISAAC 2015
• DOI:10.1007/978-3-662-48971-0_15

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

Save to Library

Create Alert

Cite

View Paper