On the generation of bicliques of a graph (Q5919931): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2007.03.017
+Normal rank
@@ Property / OpenAlex ID @@
+W2033462054
@@ Property / OpenAlex ID: W2033462054 / rank @@
+Normal rank
@@ Property / cites work @@
+Consensus algorithms for the generation of all maximal bicliques
+Normal rank
@@ Property / cites work @@
+Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs
+Normal rank
@@ Property / cites work @@
+Absolute reflexive retracts and absolute bipartite retracts
+Normal rank
@@ Property / cites work @@
+Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
+Normal rank
@@ Property / cites work @@
+On Bipartite and Multipartite Clique Problems
@@ Property / cites work: On Bipartite and Multipartite Clique Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Arboricity and bipartite subgraph listing algorithms
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Perfect Elimination and Chordal Bipartite Graphs
@@ Property / cites work: Perfect Elimination and Chordal Bipartite Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating Clique and Biclique Problems
@@ Property / cites work: Approximating Clique and Biclique Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph
+Normal rank
@@ Property / cites work @@
+Algorithm Theory - SWAT 2004
@@ Property / cites work: Algorithm Theory - SWAT 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+The maximum edge biclique problem is NP-complete
@@ Property / cites work: The maximum edge biclique problem is NP-complete / rank @@
+Normal rank
@@ Property / cites work @@
+Q4373687
@@ Property / cites work: Q4373687 / rank @@
+Normal rank
@@ Property / cites work @@
+Bicliques in graphs. I: Bounds on their number
@@ Property / cites work: Bicliques in graphs. I: Bounds on their number / rank @@
+Normal rank
@@ Property / cites work @@
+Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
+Normal rank
@@ Property / cites work @@
+Node-and edge-deletion NP-complete problems
@@ Property / cites work: Node-and edge-deletion NP-complete problems / rank @@
+Normal rank