Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters (Q5111220): Difference between revisions

@@ label / en / label / en @@
+Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters
@@ Property / arXiv ID @@
+.09487
@@ Property / arXiv ID: 1706.09487 / rank @@
+Normal rank
@@ Property / cites work @@
+Clique Relaxations in Social Network Analysis: The Maximum <i>k</i>-Plex Problem
+Normal rank
@@ Property / cites work @@
+Fourier meets M\"{o}bius: fast subset convolution
@@ Property / cites work: Fourier meets M\"{o}bius: fast subset convolution / rank @@
+Normal rank
@@ Property / cites work @@
+A Graph-Theoretic Approach to a Communications Problem
+Normal rank
@@ Property / cites work @@
+Simple upper bounds for partition functions
@@ Property / cites work: Simple upper bounds for partition functions / rank @@
+Normal rank
@@ Property / cites work @@
+Tight bounds for parameterized complexity of cluster editing with a small number of clusters
+Normal rank
@@ Property / cites work @@
+Editing graphs into disjoint unions of dense clusters
+Normal rank
@@ Property / cites work @@
+A clustering algorithm based on graph connectivity
+Normal rank
@@ Property / cites work @@
+Finding Highly Connected Subgraphs
@@ Property / cites work: Finding Highly Connected Subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes
+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 @@
+Distance-Based Clique Relaxations in Networks: s-Clique and s-Club
+Normal rank
@@ Property / OpenAlex ID @@
+W2962698119
@@ Property / OpenAlex ID: W2962698119 / rank @@
+Normal rank
@@ Property / title @@
+Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters (English)
+Normal rank