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

@@ Property / cites work @@
+Can visibility graphs be represented compactly?
@@ Property / cites work: Can visibility graphs be represented compactly? / rank @@
+Normal rank
@@ Property / cites work @@
+Efficiently covering complex networks with cliques of similar vertices
+Normal rank
@@ Property / cites work @@
+Clique Cover on Sparse Networks
@@ Property / cites work: Clique Cover on Sparse Networks / rank @@
+Normal rank
@@ Property / cites work @@
+On problems without polynomial kernels
@@ Property / cites work: On problems without polynomial kernels / rank @@
+Normal rank
@@ Property / cites work @@
+Clique coverings of the edges of a random graph
@@ Property / cites work: Clique coverings of the edges of a random graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q4448745
@@ Property / cites work: Q4448745 / rank @@
+Normal rank
@@ Property / cites work @@
+Known Algorithms for Edge Clique Cover are Probably Optimal
+Normal rank
@@ Property / cites work @@
+Clique Cover and Graph Separation
@@ Property / cites work: Clique Cover and Graph Separation / rank @@
+Normal rank
@@ Property / cites work @@
+Q3286850
@@ Property / cites work: Q3286850 / rank @@
+Normal rank
@@ Property / cites work @@
+On the average-case complexity of parameterized clique
+Normal rank
@@ Property / cites work @@
+Parameterized Clique on Scale-Free Networks
@@ Property / cites work: Parameterized Clique on Scale-Free Networks / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized clique on inhomogeneous random graphs
+Normal rank
@@ Property / cites work @@
+Covering the edges of a random graph by cliques
@@ Property / cites work: Covering the edges of a random graph by cliques / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
+Normal rank
@@ Property / cites work @@
+Algorithms for compact letter displays: comparison and evaluation
+Normal rank
@@ Property / cites work @@
+Data reduction and exact algorithms for clique cover
+Normal rank
@@ Property / cites work @@
+Bipartite structure of all complex networks
@@ Property / cites work: Bipartite structure of all complex networks / rank @@
+Normal rank
@@ Property / cites work @@
+A simple lower bound on edge coverings by cliques
@@ Property / cites work: A simple lower bound on edge coverings by cliques / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph
+Normal rank
@@ Property / cites work @@
+Q4016827
@@ Property / cites work: Q4016827 / rank @@
+Normal rank
@@ Property / cites work @@
+Covering edges by cliques with regard to keyword conflicts and intersection graphs
+Normal rank
@@ Property / cites work @@
+On the hardness of approximating minimization problems
+Normal rank
@@ Property / cites work @@
+Q3035328
@@ Property / cites work: Q3035328 / rank @@
+Normal rank
@@ Property / cites work @@
+On Random Intersection Graphs: The Subgraph Problem
+Normal rank
@@ Property / cites work @@
+Q4152571
@@ Property / cites work: Q4152571 / rank @@
+Normal rank