Exact exponential-time algorithms for finding bicliques (Q1944039): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2010.10.020
+Normal rank
@@ Property / OpenAlex ID @@
+W2136829801
@@ Property / OpenAlex ID: W2136829801 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs
+Normal rank
@@ Property / cites work @@
+Constraint Bipartite Vertex Cover Simpler Exact Algorithms and Implementations
+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 @@
+Generating bicliques of a graph in lexicographic order
+Normal rank
@@ Property / cites work @@
+An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+On Independent Sets and Bicliques in Graphs
@@ Property / cites work: On Independent Sets and Bicliques in 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 @@
+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 @@
+Node-and edge-deletion NP-complete problems
@@ Property / cites work: Node-and edge-deletion NP-complete problems / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1944039