The following pages link to (Q4152571):
Displaying 48 items.
- Upper bounds on the Boolean rank of Kronecker products (Q2146742) (← links)
- Uniform-scale assessment of role minimization in bipartite networks and its application to access control (Q2150958) (← links)
- On the intractability landscape of digraph intersection representations (Q2169961) (← links)
- Factorizing Boolean matrices using formal concepts and iterative usage of essential entries (Q2212569) (← links)
- Parameterized low-rank binary matrix approximation (Q2218414) (← links)
- Coloring temporal graphs (Q2237899) (← links)
- Edge clique partition in \((k,\ell)\)-graphs (Q2243139) (← links)
- Clustering with partial information (Q2268879) (← links)
- On the triangle clique cover and \(K_t\) clique cover problems (Q2279271) (← links)
- Large-scale clique cover of real-world networks (Q2288213) (← links)
- Edge importance in a network via line graphs and the matrix exponential (Q2290932) (← links)
- Efficient approximation for restricted biclique cover problems (Q2331611) (← links)
- More on deterministic and nondeterministic finite cover automata (Q2357103) (← links)
- Good characterizations and linear time recognition for 2-probe block graphs (Q2403805) (← links)
- The Boolean rank of the uniform intersection matrix and a family of its submatrices (Q2419048) (← links)
- Biclique completion problems for multicast network design (Q2427696) (← links)
- Clique coverings and partitions of line graphs (Q2483388) (← links)
- A linear programming formulation for the maximum complete multipartite subgraph problem (Q2583129) (← links)
- Clique Cover and Graph Separation (Q2943572) (← links)
- The Complexity of Complexity (Q2973719) (← links)
- Jump Number of Two-Directional Orthogonal Ray Graphs (Q3009778) (← links)
- Known Algorithms for Edge Clique Cover are Probably Optimal (Q3464061) (← links)
- Clustering with Partial Information (Q3599122) (← links)
- The Minimum Weight In-Tree Cover Problem (Q3627688) (← links)
- Bounds for the completely positive rank of a symmetric matrix over a tropical semiring (Q4568079) (← links)
- The Nonnegative Rank of a Matrix: Hard Problems, Easy Solutions (Q4592948) (← links)
- (Q4691865) (← links)
- On the Computation of the Competition Number of a Graph (Q4750663) (← links)
- Редукция графа при поиске реберного покрытия минимальным числом клик (Q4959050) (← links)
- Circulant almost cross intersecting families (Q5045251) (← links)
- Minimum-rank and maximum-nullity of graphs and their linear preservers (Q5080250) (← links)
- (Q5092371) (← links)
- (Q5092472) (← links)
- Sequential Relational Decomposition (Q5094122) (← links)
- A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints (Q5108220) (← links)
- (Q5146182) (← links)
- (Q5147398) (← links)
- (Q5150561) (← links)
- ON AN INVARIANT FOR THE PROBLEM OF UNDERDETERMINED DATA DECOMPOSING (Q5151198) (← links)
- Covering Graphs with Few Complete Bipartite Subgraphs (Q5458846) (← links)
- Hardness and structural results for half-squares of restricted tree convex bipartite graphs (Q5919674) (← links)
- Boolean rank of Kronecker products (Q5954858) (← links)
- Bijective linear maps on semimodules spanned by Boolean matrices of fixed rank (Q5962288) (← links)
- Elements of Fuzzy Logic in Solving Clustering Problems (Q6106695) (← links)
- Modeling combinatorial disjunctive constraints via junction trees (Q6120845) (← links)
- Sharp bounds on the least eigenvalue of a graph determined from edge clique partitions (Q6171759) (← links)
- On Blocky Ranks Of Matrices (Q6489336) (← links)
- On two variants of split graphs: 2-unipolar graph and \(k\)-probe-split graph (Q6658477) (← links)
