scientific article; zbMATH DE number 790476
From MaRDI portal
Publication:4846548
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) 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)
Recommendations
Cited in
(41)- On decompositions of complete hypergraphs
- Subsets of a finite set that almost always intersect each other in elements
- Inertia and biclique decompositions of joins of graphs
- A clique covering MIP model for the irregular strip packing problem
- The augmentation property of binary matrices for the binary and Boolean rank
- Edge clique covering sum of graphs
- A new algorithm for Boolean matrix factorization which admits overcovering
- Skew rank decompositions
- A tree whose complement is not eigensharp
- Addressing graph products and distance-regular graphs
- The saturation number of induced subposets of the Boolean lattice
- Fast constructive and improvement heuristics for edge clique covering
- From-below Boolean matrix factorization algorithm based on MDL
- The binary rank of circulant block matrices
- Boolean hierarchical Tucker networks on quantum annealers
- An overview of graph covering and partitioning
- Upper bounds on the Boolean rank of Kronecker products
- Toward quality assessment of Boolean matrix factorizations
- Chromatic characterization of biclique covers
- Sphericity, cubicity, and edge clique covers of graphs
- Transversals of Latin squares and covering radius of sets of permutations
- A linear programming formulation for the maximum complete multipartite subgraph problem
- On the binary and Boolean rank of regular matrices
- More on the bipartite decomposition of random graphs
- On co-bicliques
- Generalized covering designs and clique coverings
- Matrices attaining the minimum semidefinite rank of a chordal graph
- scientific article; zbMATH DE number 718662 (Why is no real title available?)
- scientific article; zbMATH DE number 1545697 (Why is no real title available?)
- Problems and invariants connected with bicliques and multicliques of graphs
- From-below approximations in Boolean matrix factorization: geometry and new algorithm
- scientific article; zbMATH DE number 1439493 (Why is no real title available?)
- Sphere-of-influence graphs using the sup-norm
- Boolean rank of Kronecker products
- Some eigensharp and almost eigensharp graphs
- Applications of edge coverings by cliques
- Spectral radius and clique partitions of graphs
- Clique partitions of distance multigraphs
- Row and column orthogonal (0,1)-matrices
- On eigensharp and almost eigensharp graphs
- The minimum rank of symmetric matrices described by a graph: a survey
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4846548)
