An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph (Q3386796): 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 @@
+A graph‐theoretic definition of a sociometric clique†
+Normal rank
@@ Property / cites work @@
+Clique Relaxations in Social Network Analysis: The Maximum <i>k</i>-Plex Problem
+Normal rank
@@ Property / cites work @@
+Novel approaches for analyzing biological networks
+Normal rank
@@ Property / cites work @@
+Nonlinear Programming
@@ Property / cites work: Nonlinear Programming / rank @@
+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 @@
+Q3145799
@@ Property / cites work: Q3145799 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4821526
@@ Property / cites work: Q4821526 / rank @@
+Normal rank
@@ Property / cites work @@
+Clique-detection models in computational biochemistry and genomics
+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 @@
+Clustering and domination in perfect graphs
@@ Property / cites work: Clustering and domination in perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The university of Florida sparse matrix collection
+Normal rank
@@ Property / cites work @@
+Benchmarking optimization software with performance profiles.
+Normal rank
@@ Property / cites work @@
+The dense \(k\)-subgraph problem
@@ Property / cites work: The dense \(k\)-subgraph problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5689624
@@ Property / cites work: Q5689624 / rank @@
+Normal rank
@@ Property / cites work @@
+An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach
+Normal rank
@@ Property / cites work @@
+Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
+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 @@
+A branch-and-bound approach for maximum quasi-cliques
+Normal rank
@@ Property / cites work @@
+The complexity of the matrix eigenproblem
@@ Property / cites work: The complexity of the matrix eigenproblem / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of uniqueness and local search in quadratic 0-1 programming
+Normal rank
@@ Property / cites work @@
+The maximum clique problem
@@ Property / cites work: The maximum 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 @@
+On the maximum quasi-clique problem
@@ Property / cites work: On the maximum quasi-clique problem / rank @@
+Normal rank
@@ Property / cites work @@
+A biased random-key genetic algorithm for the maximum quasi-clique problem
+Normal rank
@@ Property / cites work @@
+A graph‐theoretic generalization of the clique concept
+Normal rank
@@ Property / cites work @@
+Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for solving pseudo clique enumeration problem
+Normal rank
@@ Property / cites work @@
+Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs
+Normal rank