scientific article; zbMATH DE number 3582190

Cited in

(95)

Boolean rank of Kronecker products
Clustering with Partial Information
String execution time for finite languages: max is easy, min is hard
On the kernel size of clique cover reductions for random intersection graphs
On minimally non-firm binary matrices
Clique partitions of complements of forests and bounded degree graphs
Generalized k-tuple colorings of cycles and other graphs
Decompositions of complete multigraphs related to Hadamard matrices
A characterization of competition graphs of arbitrary digraphs
The Minimum Weight In-Tree Cover Problem
Asymptotic values of clique partition numbers
Biclique coverings of regular bigraphs and minimum semiring ranks of regular matrices
Inertia and biclique decompositions of joins of graphs
scientific article; zbMATH DE number 7301802 (Why is no real title available?)
Applications of edge coverings by cliques
Spectral radius and clique partitions of graphs
Bounds for the completely positive rank of a symmetric matrix over a tropical semiring
Mod/Resc parsimony inference: theory and application
Property testing of the Boolean and binary rank
A clique covering MIP model for the irregular strip packing problem
Covering graphs with few complete bipartite subgraphs
Clique Cover and Graph Separation
Rank one preservers between spaces of Boolean matrices
Edge cover by connected bipartite subgraphs
Minimum-rank and maximum-nullity of graphs and their linear preservers
scientific article; zbMATH DE number 7310192 (Why is no real title available?)
On the boolean minimal realization problem in the max-plus algebra
Eigenvalues and clique partitions of graphs
A generalization of the Bollobás set pairs inequality
Phylogeny numbers
On the partition and coloring of a graph by cliques
Covering arrays avoiding forbidden edges
On a symmetric representation of Hermitian matrices and its applications to graph theory
Edge-clique covers of the tensor product
Clique partitions of the cocktail party graph
On dimensional properties of graphs
Bijective linear maps on semimodules spanned by Boolean matrices of fixed rank
Edge importance in a network via line graphs and the matrix exponential
Boolean-rank-preserving operators and Boolean-rank-1 spaces
On biclique decompositions of complete \(t\)-partite graphs
Biclique completion problems for multicast network design
On the geometric interpretation of the nonnegative rank
Graph reduction in the construction of minimal clique cover
Clique coverings and partitions of line graphs
Jump number of two-directional orthogonal ray graphs
The Complexity of Complexity
On the Computation of the Competition Number of a Graph
Factoring a band matrix over a semiring
Parameterized low-rank binary matrix approximation
Edge clique covering sum of graphs
Factorizing Boolean matrices using formal concepts and iterative usage of essential entries
Hardness results for covering arrays avoiding forbidden edges and error-locating arrays
Block-graph width
Achieving distributed control through model checking
On clique partitions of split graphs
On the number of distinct minimal clique partitions and clique covers of a line graph
Clique partitions and clique coverings
On a clique covering problem of Orlin
On the complexity of cover-incomparability graphs of posets
Clique covering and clique partition in generalizations of line graphs
A set coverage problem
Coloring temporal graphs
A linear programming formulation for the maximum complete multipartite subgraph problem
Regarding two conjectures on clique and biclique partitions
On the intractability landscape of digraph intersection representations
A combinatorial approach for small and strong formulations of disjunctive constraints
Large-scale clique cover of real-world networks
On the triangle clique cover and \(K_t\) clique cover problems
On two variants of split graphs: 2-unipolar graph and \(k\)-probe-split graph
The complexity for the problems of covering of a graph with the minimum number of complete bipartite subgraphs
Walk-preserving transformation of overlapped sequence graphs into blunt sequence graphs with GetBlunted
An overview of graph covering and partitioning
Good characterizations and linear time recognition for 2-probe block graphs
On an invariant for the problem of underdetermined data decomposing
On Blocky Ranks Of Matrices
Independent sets and hitting sets of bicolored rectangular families
Uniform-scale assessment of role minimization in bipartite networks and its application to access control
The Boolean rank of the uniform intersection matrix and a family of its submatrices
Constrained representations of map graphs and half-squares
On some FPT problems without polynomial Turing compressions
Covering Graphs with Few Complete Bipartite Subgraphs
More on deterministic and nondeterministic finite cover automata
Edge clique partition in \((k,\ell)\)-graphs
Fast constructive and improvement heuristics for edge clique covering
On the complexity of directed intersection representation of DAGs
Clustering with partial information
Sharp bounds on the least eigenvalue of a graph determined from edge clique partitions
Elements of Fuzzy Logic in Solving Clustering Problems
Efficient approximation for restricted biclique cover problems
The nonnegative rank of a matrix: hard problems, easy solutions
Upper bounds on the Boolean rank of Kronecker products
scientific article; zbMATH DE number 7300407 (Why is no real title available?)
Circulant almost cross intersecting families
Modeling combinatorial disjunctive constraints via junction trees
scientific article; zbMATH DE number 7561750 (Why is no real title available?)

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 Q4152571)