On the relation of strong triadic closure and cluster deletion (Q5915591): Difference between revisions

@@ Property / cites work @@
+Even faster parameterized cluster deletion and cluster editing
+Normal rank
@@ Property / cites work @@
+Kernelization Lower Bounds by Cross-Composition
@@ Property / cites work: Kernelization Lower Bounds by Cross-Composition / rank @@
+Normal rank
@@ Property / cites work @@
+Kernel bounds for disjoint cycles and disjoint paths
+Normal rank
@@ Property / cites work @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+Your rugby mates don't need to know your colleagues: triadic closure with edge colors
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+The cluster deletion problem for cographs
@@ Property / cites work: The cluster deletion problem for cographs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5116487
@@ Property / cites work: Q5116487 / rank @@
+Normal rank
@@ Property / cites work @@
+On the relation of strong triadic closure and cluster deletion
+Normal rank
@@ Property / cites work @@
+A more effective linear kernelization for cluster editing
+Normal rank
@@ Property / cites work @@
+The NP-Completeness of Edge-Coloring
@@ Property / cites work: The NP-Completeness of Edge-Coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Cluster editing with locally bounded modifications
+Normal rank
@@ Property / cites work @@
+Strong triadic closure in cographs and graphs of low maximum degree
+Normal rank
@@ Property / cites work @@
+Q5136273
@@ Property / cites work: Q5136273 / rank @@
+Normal rank
@@ Property / cites work @@
+Gallai graphs and anti-Gallai graphs
@@ Property / cites work: Gallai graphs and anti-Gallai graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Paw-free graphs
@@ Property / cites work: Paw-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4770411
@@ Property / cites work: Q4770411 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4288086
@@ Property / cites work: Q4288086 / rank @@
+Normal rank
@@ Property / cites work @@
+Applying modular decomposition to parameterized cluster editing problems
+Normal rank
@@ Property / cites work @@
+Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
+Normal rank
@@ Property / cites work @@
+Cluster graph modification problems
@@ Property / cites work: Cluster graph modification problems / rank @@
+Normal rank
@@ Property / cites work @@
+Two classes of perfect graphs
@@ Property / cites work: Two classes of perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-parameter algorithms for maximum-profit facility location under matroid constraints
+Normal rank