The complexity for the problems of covering of a graph with the minimum number of complete bipartite subgraphs
From MaRDI portal
Publication:4691865
Recommendations
- Covering Graphs with Few Complete Bipartite Subgraphs
- Covering graphs with few complete bipartite subgraphs
- Polynomially solvable cases of the minimum biclique vertex-cover problem
- Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
- Edge cover by connected bipartite subgraphs
Cites work
- Algorithms for finding biclique covers of graphs with bounded pathwidth
- Approximating Clique and Biclique Problems
- Approximation hardness of dominating set problems in bounded degree graphs
- Bipartite graphs without a skew star
- Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs
- Covering graphs with few complete bipartite subgraphs
- scientific article; zbMATH DE number 4204394 (Why is no real title available?)
- scientific article; zbMATH DE number 5543290 (Why is no real title available?)
- scientific article; zbMATH DE number 3828714 (Why is no real title available?)
- scientific article; zbMATH DE number 3582190 (Why is no real title available?)
- scientific article; zbMATH DE number 2044943 (Why is no real title available?)
- scientific article; zbMATH DE number 1534645 (Why is no real title available?)
- scientific article; zbMATH DE number 1559563 (Why is no real title available?)
- On bipartite and multipartite clique problems
Cited in
(22)- Covering graphs with few complete bipartite subgraphs
- Covering the edges of bipartite graphs using \(K_{2,2}\) graphs
- Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs
- On the complexity of the identifiable subgraph problem, revisited
- A lower bound for the Graver complexity of the incidence matrix of a complete bipartite graph
- Packing bipartite graphs with covers of complete bipartite graphs
- The maximum vertex coverage problem on bipartite graphs
- On the computational complexity of partial covers of theta graphs
- On the complexity of construction of complete and complete bipartite graphs
- Packing bipartite graphs with covers of complete bipartite graphs
- scientific article; zbMATH DE number 89406 (Why is no real title available?)
- scientific article; zbMATH DE number 1339492 (Why is no real title available?)
- Bi-covering: covering edges with two small subsets of vertices
- Bicovering: covering edges with two small subsets of vertices
- scientific article; zbMATH DE number 1855660 (Why is no real title available?)
- Decompositional approach to research of formal contexts
- Polynomially solvable cases of the minimum biclique vertex-cover problem
- Covering the Edges of Bipartite Graphs Using K 2,2 Graphs
- Covering Graphs with Few Complete Bipartite Subgraphs
- scientific article; zbMATH DE number 7724194 (Why is no real title available?)
- Edge cover by connected bipartite subgraphs
- Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
This page was built for publication: The complexity for the problems of covering of a graph with the minimum number of complete bipartite subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4691865)
