On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs (Q448967): Difference between revisions

@@ Property / cites work @@
+Q3145799
@@ Property / cites work: Q3145799 / rank @@
+Normal rank
@@ Property / cites work @@
+Clique-detection models in computational biochemistry and genomics
+Normal rank
@@ Property / cites work @@
+Mining market data: a network approach
@@ Property / cites work: Mining market data: a network approach / rank @@
+Normal rank
@@ Property / cites work @@
+Q4945528
@@ Property / cites work: Q4945528 / rank @@
+Normal rank
@@ Property / cites work @@
+A graph‐theoretic generalization of the clique concept
+Normal rank
@@ Property / cites work @@
+A graph‐theoretic definition of a sociometric clique†
+Normal rank
@@ Property / cites work @@
+Clustering and domination in perfect graphs
@@ Property / cites work: Clustering and domination in perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Heuristic and Special Case Algorithms for Dispersion Problems
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Clique is hard to approximate within \(n^{1-\epsilon}\)
+Normal rank
@@ Property / cites work @@
+Fixed-parameter tractability and completeness II: On completeness for W[1]
+Normal rank
@@ Property / cites work @@
+An exact algorithm for the maximum \(k\)-club problem in an undirected graph
+Normal rank
@@ Property / cites work @@
+Novel approaches for analyzing biological networks
+Normal rank
@@ Property / cites work @@
+Heuristics for finding \(k\)-clubs in an undirected graph
+Normal rank
@@ Property / cites work @@
+On approximating the maximum diameter ratio of graphs
+Normal rank
@@ Property / cites work @@
+Approximating Maximum Diameter-Bounded Subgraphs
@@ Property / cites work: Approximating Maximum Diameter-Bounded Subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Upper bounds and heuristics for the 2-club problem
+Normal rank
@@ Property / cites work @@
+Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems
+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 @@
+Q3135082
@@ Property / cites work: Q3135082 / rank @@
+Normal rank
@@ Property / cites work @@
+Generalizations of Cliques, Odd Cycles and Anticycles and Their Relation to Independence System Polyhedra
+Normal rank
@@ Property / cites work @@
+An exact algorithm for the maximum clique problem
@@ Property / cites work: An exact algorithm for the maximum clique problem / rank @@
+Normal rank
@@ Property / cites work @@
+A fast algorithm for the maximum clique problem
@@ Property / cites work: A fast algorithm for the maximum clique problem / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal approximation of sparse hessians and its equivalence to a graph coloring problem
+Normal rank
@@ Property / cites work @@
+New methods to color the vertices of a graph
@@ Property / cites work: New methods to color the vertices of a graph / rank @@
+Normal rank