Algorithms for constructing \((0,1)\)-matrices with prescribed row and column sum vectors
From MaRDI portal
Publication:856850
DOI10.1016/j.disc.2004.10.028zbMath1110.05102OpenAlexW1995751254MaRDI QIDQ856850
Publication date: 14 December 2006
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2004.10.028
algorithmsYoung tableauxKostka numbersGale-Ryser theoremKnuth-Schensted correspondencerow and columns sum vectorsRyser algorithm
Related Items
Chains and Antichains in the Bruhat Order for Classes of (0, 1)-Matrices ⋮ New summary measures and datasets for the multi-project scheduling problem ⋮ An extension of Brualdi's algorithm for the construction of \((0,1)\)-matrices with prescribed row and column sum vectors ⋮ On the largest size of an antichain in the Bruhat order for \(\mathcal A (2k,k)\) ⋮ On maximum chains in the Bruhat order of \(\mathcal A(n,2)\) ⋮ The maximal length of a chain in the Bruhat order for a class of binary matrices ⋮ A catalog of self-affine hierarchical entropy functions ⋮ Decomposable Pauli diagonal maps and tensor squares of qubit maps ⋮ Antichains of \((0, 1)\)-matrices through inversions ⋮ New linearizations of quadratic assignment problems ⋮ Majorization and the number of bipartite graphs for given vertex degrees ⋮ On (0, 1)-matrices with prescribed row and column sum vectors ⋮ SPC product codes, graphs with cycles and Kostka numbers ⋮ Binary image reconstruction based on prescribed numerical information
Cites Work
