On covering graphs by complete bipartite subgraphs
From MaRDI portal
Recommendations
Cites work
- Applications of matrix methods to the theory of lower bounds in computational complexity
- Bipartite Coverings of Graphs
- Covering graphs by the minimum number of equivalence relations
- Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
- Fractional Covers and Communication Complexity
- Graph complexity and slice functions
- scientific article; zbMATH DE number 4078803 (Why is no real title available?)
- scientific article; zbMATH DE number 970791 (Why is no real title available?)
- Method of determining lower bounds for the complexity of \(\Pi\)-circuits
- On Graph Complexity
- On set intersection representations of graphs
- On the Addressing Problem for Loop Switching
- On the coverings of graphs
- On the fractional intersection number of a graph
- On the ratio of optimal integral and fractional covers
- Problems and results in extremal combinatorics. I.
- Some structural properties of low-rank matrices related to computational complexity
- The Shrinkage Exponent of de Morgan Formulas is 2
Cited in
(26)- Covering a graph by complete bipartite graphs
- Biclique cover and local clique cover of graphs
- Regarding two conjectures on clique and biclique partitions
- An overview of graph covering and partitioning
- Efficient approximation for restricted biclique cover problems
- Ordered biclique partitions and communication complexity problems
- Fooling-sets and rank
- Some improved bounds on communication complexity via new decomposition of cliques
- On set intersection representations of graphs
- scientific article; zbMATH DE number 3972916 (Why is no real title available?)
- scientific article; zbMATH DE number 175738 (Why is no real title available?)
- Biclique covers and partitions
- Mod/Resc parsimony inference: theory and application
- scientific article; zbMATH DE number 718634 (Why is no real title available?)
- Bipartite Coverings of Graphs
- Fractional coverings, greedy coverings, and rectifier networks
- On biclique covering number of the Cartesian product of graphs
- Problems and invariants connected with bicliques and multicliques of graphs
- Turán and Ramsey properties of subcube intersection graphs
- Communication complexity of pairs of graph families with applications
- Communication complexity and graph families
- scientific article; zbMATH DE number 7706048 (Why is no real title available?)
- Bounded-depth succinct encodings and the structure they imply on graphs
- Compact representation of semilinear and terrain-like graphs
- Perfect codes and biclique partition number of Cayley sum signed graph
- Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
This page was built for publication: On covering graphs by complete bipartite subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1025967)
