scientific article; zbMATH DE number 790476
From MaRDI portal
Publication:4846548
zbMath0832.05088MaRDI QIDQ4846548
Norman J. Pullman, R. S. Rees, Sylvia D. Monson
Publication date: 20 February 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Numerical methods for integral transforms (65R10) Eulerian and Hamiltonian graphs (05C45)
Related Items (36)
Spectral radius and clique partitions of graphs ⋮ Boolean hierarchical Tucker networks on quantum annealers ⋮ Chromatic characterization of biclique covers ⋮ An overview of graph covering and partitioning ⋮ Upper bounds on the Boolean rank of Kronecker products ⋮ Subsets of a finite set that almost always intersect each other in \(\lambda\) elements ⋮ Unnamed Item ⋮ A clique covering MIP model for the irregular strip packing problem ⋮ The augmentation property of binary matrices for the binary and Boolean rank ⋮ Skew rank decompositions ⋮ Matrices attaining the minimum semidefinite rank of a chordal graph ⋮ More on the Bipartite Decomposition of Random Graphs ⋮ Inertia and biclique decompositions of joins of graphs ⋮ Toward quality assessment of Boolean matrix factorizations ⋮ On the binary and Boolean rank of regular matrices ⋮ Edge clique covering sum of graphs ⋮ A tree whose complement is not eigensharp ⋮ Clique partitions of distance multigraphs ⋮ From-below approximations in Boolean matrix factorization: geometry and new algorithm ⋮ On co-bicliques ⋮ Row and column orthogonal (0,1)-matrices ⋮ On eigensharp and almost eigensharp graphs ⋮ Sphere-of-influence graphs using the sup-norm ⋮ Addressing graph products and distance-regular graphs ⋮ The saturation number of induced subposets of the Boolean lattice ⋮ Sphericity, cubicity, and edge clique covers of graphs ⋮ Fast constructive and improvement heuristics for edge clique covering ⋮ Boolean rank of Kronecker products ⋮ The minimum rank of symmetric matrices described by a graph: a survey ⋮ Transversals of Latin squares and covering radius of sets of permutations ⋮ From-below Boolean matrix factorization algorithm based on MDL ⋮ A new algorithm for Boolean matrix factorization which admits overcovering ⋮ Generalized covering designs and clique coverings ⋮ On decompositions of complete hypergraphs ⋮ The binary rank of circulant block matrices ⋮ A linear programming formulation for the maximum complete multipartite subgraph problem
This page was built for publication:
