A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing (Q3638452): Difference between revisions

@@ Property / cites work @@
+Clique Relaxations in Social Network Analysis: The Maximum <i>k</i>-Plex Problem
+Normal rank
@@ Property / cites work @@
+Correlation clustering
@@ Property / cites work: Correlation clustering / rank @@
+Normal rank
@@ Property / cites work @@
+Going Weighted: Parameterized Algorithms for Cluster Editing
+Normal rank
@@ Property / cites work @@
+Exact Algorithms for Cluster Editing: Evaluation and Experiments
+Normal rank
@@ Property / cites work @@
+Efficient Parameterized Preprocessing for Cluster Editing
+Normal rank
@@ Property / cites work @@
+A more effective linear kernelization for cluster editing
+Normal rank
@@ Property / cites work @@
+Isolation Concepts for Enumerating Dense Subgraphs
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+A graph‐theoretic generalization of the clique concept
+Normal rank
@@ Property / cites work @@
+Cluster graph modification problems
@@ Property / cites work: Cluster graph modification problems / rank @@
+Normal rank
@@ Property / cites work @@
+Depth-First Search and Linear Graph Algorithms
@@ Property / cites work: Depth-First Search and Linear Graph Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
+Normal rank