Asymptotic bounds for clustering problems in random graphs (Q6196888): Difference between revisions

@@ Property / cites work @@
+Q4945528
@@ Property / cites work: Q4945528 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3044359
@@ Property / cites work: Q3044359 / rank @@
+Normal rank
@@ Property / cites work @@
+Turan's Graph Theorem
@@ Property / cites work: Turan's Graph Theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Partitioning and Graph Clustering
@@ Property / cites work: Graph Partitioning and Graph Clustering / rank @@
+Normal rank
@@ Property / cites work @@
+Clique Relaxations in Social Network Analysis: The Maximum <i>k</i>-Plex Problem
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes
+Normal rank
@@ Property / cites work @@
+Dense subgraphs in random graphs
@@ Property / cites work: Dense subgraphs in random graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Emergence of Scaling in Random Networks
@@ Property / cites work: Emergence of Scaling in Random Networks / rank @@
+Normal rank
@@ Property / cites work @@
+Q3003675
@@ Property / cites work: Q3003675 / rank @@
+Normal rank
@@ Property / cites work @@
+The nature of computation. Logic, algorithms, applications. 9th conference on computability in Europe, CiE 2013, Milan, Italy, July 1--5, 2013. Proceedings
+Normal rank
@@ Property / cites work @@
+Q4398864
@@ Property / cites work: Q4398864 / rank @@
+Normal rank
@@ Property / cites work @@
+Cliques in random graphs
@@ Property / cites work: Cliques in random graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Network analysis. Methodological foundations.
@@ Property / cites work: Network analysis. Methodological foundations. / rank @@
+Normal rank
@@ Property / cites work @@
+A \(2k\) kernel for the cluster editing problem
@@ Property / cites work: A \(2k\) kernel for the cluster editing problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q3286850
@@ Property / cites work: Q3286850 / rank @@
+Normal rank
@@ Property / cites work @@
+The maximum independent union of cliques problem: complexity and exact approaches
+Normal rank
@@ Property / cites work @@
+Cluster analysis and mathematical programming
@@ Property / cites work: Cluster analysis and mathematical programming / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-parameter algorithms for cluster vertex deletion
+Normal rank
@@ Property / cites work @@
+On the 2-Club Polytope of Graphs
@@ Property / cites work: On the 2-Club Polytope of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the maximum quasi-clique problem
@@ Property / cites work: On the maximum quasi-clique problem / rank @@
+Normal rank
@@ Property / cites work @@
+On clique relaxation models in network analysis
@@ Property / cites work: On clique relaxation models in network analysis / rank @@
+Normal rank
@@ Property / cites work @@
+The maximum number of induced open triangles in graphs of a given order
+Normal rank
@@ Property / cites work @@
+A graph‐theoretic generalization of the clique concept
+Normal rank
@@ Property / cites work @@
+Distance-Based Clique Relaxations in Networks: s-Clique and s-Club
+Normal rank
@@ Property / cites work @@
+Distinguishing power-law uniform random graphs from inhomogeneous random graphs through small subgraphs
+Normal rank
@@ Property / cites work @@
+Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
+Normal rank
@@ Property / cites work @@
+Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs
+Normal rank
@@ Property / cites work @@
+Node-and edge-deletion NP-complete problems
@@ Property / cites work: Node-and edge-deletion NP-complete problems / rank @@
+Normal rank
@@ Property / cites work @@
+Exact algorithms for the minimum \(s\)-club partitioning problem
+Normal rank