Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations (Q360375): Difference between revisions

@@ Property / cites work @@
+Q4945528
@@ Property / cites work: Q4945528 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding maximum cliques in arbitrary and in special graphs
+Normal rank
@@ Property / cites work @@
+Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring
+Normal rank
@@ Property / cites work @@
+Finding a Maximum Clique in an Arbitrary Graph
@@ Property / cites work: Finding a Maximum Clique in an Arbitrary Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Russian doll search for the Steiner triple covering problem
+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 @@
+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 @@
+Algorithm 457: finding all cliques of an undirected graph
+Normal rank
@@ Property / cites work @@
+A new table of constant weight codes
@@ Property / cites work: A new table of constant weight codes / 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 @@
+Q3122895
@@ Property / cites work: Q3122895 / rank @@
+Normal rank
@@ Property / cites work @@
+Test case generators and computational results for the maximum clique problem
+Normal rank
@@ Property / cites work @@
+Q3139747
@@ Property / cites work: Q3139747 / rank @@
+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 @@
+Q4714131
@@ Property / cites work: Q4714131 / rank @@
+Normal rank
@@ Property / cites work @@
+The node-deletion problem for hereditary properties is NP-complete
+Normal rank
@@ Property / cites work @@
+The approximation of maximum subgraph problems
@@ Property / cites work: The approximation of maximum subgraph problems / rank @@
+Normal rank
@@ Property / cites work @@
+The Co-2-plex Polytope and Integral Systems
@@ Property / cites work: The Co-2-plex Polytope and Integral Systems / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial algorithms for the maximum \(k\)-plex problem
+Normal rank
@@ Property / cites work @@
+Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes
+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 @@
+On clique relaxation models in network analysis
@@ Property / cites work: On clique relaxation models in network analysis / rank @@
+Normal rank
@@ Property / cites work @@
+A graph‐theoretic generalization of the clique concept
+Normal rank
@@ Property / cites work @@
+Q4793326
@@ Property / cites work: Q4793326 / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
+Normal rank
@@ Property / cites work @@
+Q4397004
@@ Property / cites work: Q4397004 / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithm for finding a maximum clique in a graph
+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 @@
+The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems
+Normal rank