On the kernel size of clique cover reductions for random intersection graphs (Q491163): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+C80
@@ Property / Mathematics Subject Classification ID: 05C80 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C69
@@ Property / Mathematics Subject Classification ID: 05C69 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C85
@@ Property / Mathematics Subject Classification ID: 05C85 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6475114
@@ Property / zbMATH DE Number: 6475114 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+parameterized algorithms
@@ Property / zbMATH Keywords: parameterized algorithms / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+clique cover
@@ Property / zbMATH Keywords: clique cover / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+kernelization
@@ Property / zbMATH Keywords: kernelization / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+average case
@@ Property / zbMATH Keywords: average case / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+random intersection graphs
@@ Property / zbMATH Keywords: random intersection graphs / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+Erdős-Rényi graphs
@@ Property / zbMATH Keywords: Erdős-Rényi graphs / rank @@
+Normal rank

Revision as of 21:48, 30 June 2023