Pages that link to "Item:Q856850"
From MaRDI portal
The following pages link to Algorithms for constructing \((0,1)\)-matrices with prescribed row and column sum vectors (Q856850):
Displaying 15 items.
- An extension of Brualdi's algorithm for the construction of \((0,1)\)-matrices with prescribed row and column sum vectors (Q393474) (← links)
- The maximal length of a chain in the Bruhat order for a class of binary matrices (Q649577) (← links)
- On (0, 1)-matrices with prescribed row and column sum vectors (Q1025513) (← links)
- A catalog of self-affine hierarchical entropy functions (Q1736493) (← links)
- New linearizations of quadratic assignment problems (Q1761235) (← links)
- On the largest size of an antichain in the Bruhat order for \(\mathcal A (2k,k)\) (Q1943693) (← links)
- Antichains of \((0, 1)\)-matrices through inversions (Q2250943) (← links)
- SPC product codes, graphs with cycles and Kostka numbers (Q2331735) (← links)
- Binary image reconstruction based on prescribed numerical information (Q2355370) (← links)
- On maximum chains in the Bruhat order of \(\mathcal A(n,2)\) (Q2442380) (← links)
- New summary measures and datasets for the multi-project scheduling problem (Q2670516) (← links)
- Chains and Antichains in the Bruhat Order for Classes of (0, 1)-Matrices (Q4554532) (← links)
- Majorization and the number of bipartite graphs for given vertex degrees (Q5135453) (← links)
- Decomposable Pauli diagonal maps and tensor squares of qubit maps (Q5154267) (← links)
- The Kostka semigroup and its Hilbert basis (Q6659975) (← links)
