The following pages link to (Q4846548):
Displaying 36 items.
- Matrices attaining the minimum semidefinite rank of a chordal graph (Q389640) (← links)
- From-below approximations in Boolean matrix factorization: geometry and new algorithm (Q494072) (← links)
- Spectral radius and clique partitions of graphs (Q820994) (← links)
- Clique partitions of distance multigraphs (Q932596) (← links)
- Row and column orthogonal (0,1)-matrices (Q952067) (← links)
- On eigensharp and almost eigensharp graphs (Q952068) (← links)
- The minimum rank of symmetric matrices described by a graph: a survey (Q996311) (← links)
- On decompositions of complete hypergraphs (Q1040837) (← links)
- Subsets of a finite set that almost always intersect each other in \(\lambda\) elements (Q1356776) (← links)
- Inertia and biclique decompositions of joins of graphs (Q1405108) (← links)
- A clique covering MIP model for the irregular strip packing problem (Q1652422) (← links)
- The augmentation property of binary matrices for the binary and Boolean rank (Q1668986) (← links)
- Edge clique covering sum of graphs (Q1701317) (← links)
- A new algorithm for Boolean matrix factorization which admits overcovering (Q1800383) (← links)
- Skew rank decompositions (Q1923213) (← links)
- A tree whose complement is not eigensharp (Q1971045) (← links)
- Addressing graph products and distance-regular graphs (Q2012052) (← links)
- The saturation number of induced subposets of the Boolean lattice (Q2012537) (← links)
- Fast constructive and improvement heuristics for edge clique covering (Q2019428) (← links)
- From-below Boolean matrix factorization algorithm based on MDL (Q2036139) (← links)
- The binary rank of circulant block matrices (Q2093516) (← links)
- Boolean hierarchical Tucker networks on quantum annealers (Q2128464) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Upper bounds on the Boolean rank of Kronecker products (Q2146742) (← links)
- Toward quality assessment of Boolean matrix factorizations (Q2198096) (← links)
- Chromatic characterization of biclique covers (Q2368922) (← links)
- Sphericity, cubicity, and edge clique covers of graphs (Q2495913) (← links)
- Transversals of Latin squares and covering radius of sets of permutations (Q2509702) (← links)
- A linear programming formulation for the maximum complete multipartite subgraph problem (Q2583129) (← links)
- On the binary and Boolean rank of regular matrices (Q2689370) (← links)
- More on the Bipartite Decomposition of Random Graphs (Q2958197) (← links)
- On co-bicliques (Q3004204) (← links)
- Generalized covering designs and clique coverings (Q3100732) (← links)
- (Q4691855) (← links)
- Sphere-of-influence graphs using the sup-norm (Q5927945) (← links)
- Boolean rank of Kronecker products (Q5954858) (← links)
