Combinatorial Properties of Matrices of Zeros and Ones

Cited In (only showing first 100 items - show all)

Market implementation of multiple-arrival multiple-deadline differentiated energy services
Stuttering blocks of Ariki-Koike algebras
Solution to an extremal problem on bigraphic pairs with a \(Z_3\)-connected realization
On 12-regular nut graphs
Number of 1-factorizations of regular high-degree graphs
The sum necessary to ensure that a degree sequence pair has an \(a\)-connected realization
The structure matrix of the class of \(r\)-multigraphs with a prescribed degree sequence
Rejection sampling of bipartite graphs with given degree sequence
Relaxed and approximate graph realizations
Wide partitions, Latin tableaux, and Rota's basis conjecture
Gram mates, sign changes in singular values, and isomorphism
Planar bipartite biregular degree sequences
Spatiotemporal conditional inference and hypothesis tests for neural ensemble spiking precision
A minimal completion of \((0,1)\)-matrices without total support
Transitive partitions in realizations of tournament score sequences
On the König-Hall-Egerváry theorem for multidimensional matrices and multipartite hypergraphs
Leaf realization problem, caterpillar graphs and prefix normal words
Neighborhood degree lists of graphs
Asymptotic joint distribution of the extremities of a random Young diagram and enumeration of graphical partitions
Algorithms for linear time reconstruction by discrete tomography. II
Uniform and monotone line sum optimization
The relationship between the class \({\mathfrak A}_2(R,S)\) of (0, 1, 2)-matrices and the collection of constellation matrices
On line sum optimization
Matrices of zeros and ones with the maximum jump number
On the bipartite graph packing problem
Recursion formulas for poly-Bernoulli numbers and their applications
Estimating parameters of a probabilistic heterogeneous block model via the EM algorithm
A geometrical characterization of regions of uniqueness and applications to discrete tomography
Supermodularity in unweighted graph optimization. II: Matroidal term rank augmentation
Alternating signed bipartite graphs and difference-1 colourings
On the properties of interchange operations in classes of \((0,1)\)- matrices
Graphs and degree sequences. I
On the enumeration of rectangular (0, 1)-matrices
Minimum degree conditions for the strength and bandwidth of graphs
On factorable bigraphic pairs
Multidimensional matrices uniquely recovered by their lines
Common greedy wiring and rewiring heuristics do not guarantee maximum assortative graphs of given degree
On some geometric aspects of the class of \(hv\)-convex switching components
Lonesum and \(\Gamma\)-free \(0-1\) fillings of Ferrers shapes
On vertex-weighted realizations of acyclic and general graphs
Lonesum decomposable matrices
Improved queue-size scaling for input-queued switches via graph factorization
Randomization methods for assessing data analysis results on real‐valued matrices
Regular switching components
Two-dimensional digitized picture arrays and Parikh matrices
The switch Markov chain for sampling irregular graphs and digraphs
Supermodularity in unweighted graph optimization. I: Branchings and matchings
Composed degree-distance realizations of graphs
Extremal values of the chromatic number for a given degree sequence
On nearly self-conjugate partitions of a finite set
Supermodularity in unweighted graph optimization. III: Highly connected digraphs
On the largest size of an antichain in the Bruhat order for \(\mathcal A (2k,k)\)
Term rank of \(0,1\) matrices
Exact sampling and counting for fixed-margin matrices
Comparison of algorithms for reconstructing \(hv\)-convex discrete sets
Switching codes and designs
On the realization of a (p,s)-digraph with prescribed degrees
On the precise number of (0, 1)-matrices in \({\mathfrak A}(R,S)\)
Discrete tomography determination of bounded lattice sets from four X-rays
Some NP-complete problems for hypergraph degree sequences
Random graphs with a given degree sequence
A Gale-Ryser type characterization of potentially \(K_{s,t}\)-bigraphic pairs
Constructive extensions of two results on graphic sequences
On a graph coloring problem arising from discrete tomography
A constructive extension of the characterization on potentially \(K_{s,t}\)-bigraphic pairs
Majorization permutahedra and (0,1)-matrices
Switching components and the ambiguity problem in the reconstruction of pictures from their projections
On (0, 1)-matrices with prescribed row and column sum vectors
Sufficient conditions for graphicality of bidegree sequences
A sufficient condition for a pair of sequences to be bipartite graphic
Contributions to the theory of graphic sequences
On the computational complexity of reconstructing three-dimensional lattice sets from their two-dimensional \(X\)-rays
An extremal problem on bigraphic pairs with an \(A\)-connected realization
Reconstruction of convex 2D discrete sets in polynomial time
Ghosts in discrete tomography
Bemerkungen zur Theorie der Matrizen aus Nullen und Einsen
Analysis on the strip-based projection model for discrete tomography
An algorithm for finding the number of (0, 1, 2,…, l)-matrices with prefixed row sum and column sum vectors
Realizing degree sequences with \(k\)-edge-connected uniform hypergraphs
Stability results for uniquely determined sets from two directions in discrete tomography
Reconstruction of 8-connected but not 4-connected \(hv\)-convex discrete sets
Realizability and uniqueness in graphs
Sets of uniqueness and minimal matrices
On tiling under tomographic constraints.
Prime interchange graphs of classes of matrices of zeros and ones
Colour degree matrices of graphs with at most one cycle
On the algorithmic inversion of the discrete Radon transform
Reconstruction of binary matrices under adjacency constraints
Bigraphic pairs with an \(A\)-connected realization
Matrices of zeros and ones with fixed row and column sum vectors
Realizing disjoint degree sequences of span at most two: a tractable discrete tomography problem
Block-transitive \(t\)-designs. I: Point-imprimitive designs
Young diagrams, Schur functions, the Gale-Ryser theorem and a conjecture or Snapper
On the use of graphs in discrete tomography
Integer matrices with constraints on leading partial row and column sums
Mathematical programming approaches for classes of random network problems
Plane partitions and characters of the symmetric group
The Grone-Merris conjecture
Optimization and reconstruction of \(hv\)-convex (0,1)-matrices
Matrices of zeros and ones with given line sums and a zero block

This page was built for publication: Combinatorial Properties of Matrices of Zeros and Ones

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