scientific article; zbMATH DE number 3582190

Cited in

(only showing first 100 items - show all)

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

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)