Enumerating all maximal biclusters in numerical datasets (Q2292925): Difference between revisions

@@ Property / cites work @@
+Characterizing functional dependencies in formal concept analysis with pattern structures
+Normal rank
@@ Property / cites work @@
+Algorithm 457: finding all cliques of an undirected graph
+Normal rank
@@ Property / cites work @@
+A note on the problem of reporting maximal cliques
+Normal rank
@@ Property / cites work @@
+Q5282974
@@ Property / cites work: Q5282974 / rank @@
+Normal rank
@@ Property / cites work @@
+Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time
+Normal rank
@@ Property / cites work @@
+Q3149779
@@ Property / cites work: Q3149779 / rank @@
+Normal rank
@@ Property / cites work @@
+Enumeration aspects of maximal cliques and bicliques
+Normal rank
@@ Property / cites work @@
+Biclustering Numerical Data in Formal Concept Analysis
+Normal rank
@@ Property / cites work @@
+Enumerating all connected maximal common subgraphs in two graphs
+Normal rank
@@ Property / cites work @@
+Mathematical aspects of concept analysis
@@ Property / cites work: Mathematical aspects of concept analysis / rank @@
+Normal rank
@@ Property / cites work @@
+Q5493143
@@ Property / cites work: Q5493143 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithm Theory - SWAT 2004
@@ Property / cites work: Algorithm Theory - SWAT 2004 / rank @@
+Normal rank