Listing closed sets of strongly accessible set systems with applications to data mining (Q844900): Difference between revisions

@@ Property / author @@
-Tamás L. Horváth
@@ Property / author: Tamás L. Horváth / rank @@
-Normal rank
@@ Property / author @@
+Tamás L. Horváth
@@ Property / author: Tamás L. Horváth / rank @@
+Normal rank
@@ 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.tcs.2009.10.024
+Normal rank
@@ Property / OpenAlex ID @@
+W2084044979
@@ Property / OpenAlex ID: W2084044979 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding all closed sets: A general approach
@@ Property / cites work: Finding all closed sets: A general approach / rank @@
+Normal rank
@@ Property / cites work @@
+Q4230685
@@ Property / cites work: Q4230685 / rank @@
+Normal rank
@@ Property / cites work @@
+Formal Concept Analysis
@@ Property / cites work: Formal Concept Analysis / rank @@
+Normal rank
@@ Property / cites work @@
+Discovery Science
@@ Property / cites work: Discovery Science / rank @@
+Normal rank
@@ Property / cites work @@
+On generating all maximal independent sets
@@ Property / cites work: On generating all maximal independent sets / rank @@
+Normal rank
@@ Property / cites work @@
+Graph-Theoretic Concepts in Computer Science
@@ Property / cites work: Graph-Theoretic Concepts in Computer Science / rank @@
+Normal rank
@@ Property / cites work @@
+Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
+Normal rank
@@ Property / cites work @@
+Q4708328
@@ Property / cites work: Q4708328 / rank @@
+Normal rank