Obtaining a triangular matrix by independent row-column permutations

DOI10.1007/978-3-662-48971-0_15MaRDI QIDQ3459859zbMATH OpenOpenAlexFDO

Authors Guillaume Fertin, Irena Rusu, Stéphane Vialette

Publication date 11 January 2016

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-48971-0_15

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms (68W40)

Recommendations

• Packing of (0, 1)-matrices
• Permuting matrices to avoid forbidden submatrices
• Triangular blocks of zeros in (0,1) matrices with small permanents
• A More Powerful Method for Triangularizing Input-Output Matrices: A Comment
• scientific article; zbMATH DE number 3848609

Cited in

(5)

• A More Powerful Method for Triangularizing Input-Output Matrices: A Comment
• Triangle width problem: at the intersection of graph theory, scheduling, and matrix visualization
• Computing the determinant of a dense matrix over \(\mathbb{Z}\)
• Computing Hamiltonian paths with partial order restrictions
• On the action of the Weyl group on canonical bases

This page was built for publication: Obtaining a triangular matrix by independent row-column permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3459859)