Why Is Maximum Clique Often Easy in Practice? (Q5144801): Difference between revisions

@@ Property / cites work @@
+Q4945528
@@ Property / cites work: Q4945528 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5241193
@@ Property / cites work: Q5241193 / rank @@
+Normal rank
@@ Property / cites work @@
+Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover
+Normal rank
@@ Property / cites work @@
+An improved fixed-parameter algorithm for vertex cover
+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 @@
+Q3221758
@@ Property / cites work: Q3221758 / rank @@
+Normal rank
@@ Property / cites work @@
+Set Partitioning via Inclusion-Exclusion
@@ Property / cites work: Set Partitioning via Inclusion-Exclusion / rank @@
+Normal rank
@@ Property / cites work @@
+Q3145799
@@ Property / cites work: Q3145799 / rank @@
+Normal rank
@@ Property / cites work @@
+Models of Online Social Networks
@@ Property / cites work: Models of Online Social Networks / rank @@
+Normal rank
@@ Property / cites work @@
+CSDP, A C library for semidefinite programming
@@ Property / cites work: CSDP, A C library for semidefinite programming / rank @@
+Normal rank
@@ Property / cites work @@
+Solving maximum clique in sparse graphs: an \({O(nm+n2^{d/4})}\) algorithm for \(d\)-degenerate graphs
+Normal rank
@@ Property / cites work @@
+Nondeterminism within $P^ *  $
@@ Property / cites work: Nondeterminism within $P^ * $ / rank @@
+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 @@
+Vertex Cover: Further Observations and Further Improvements
+Normal rank
@@ Property / cites work @@
+Improved upper bounds for vertex cover
@@ Property / cites work: Improved upper bounds for vertex cover / rank @@
+Normal rank
@@ Property / cites work @@
+Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size
+Normal rank
@@ Property / cites work @@
+Graph-Theoretic Concepts in Computer Science
@@ Property / cites work: Graph-Theoretic Concepts in Computer Science / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete
+Normal rank
@@ Property / cites work @@
+Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses
+Normal rank
@@ Property / cites work @@
+Listing All Maximal Cliques in Large Sparse Real-World Graphs
+Normal rank
@@ Property / cites work @@
+On chromatic number of graphs and set-systems
@@ Property / cites work: On chromatic number of graphs and set-systems / rank @@
+Normal rank
@@ Property / cites work @@
+A Sufficient Condition for Backtrack-Free Search
@@ Property / cites work: A Sufficient Condition for Backtrack-Free Search / rank @@
+Normal rank
@@ Property / cites work @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+Clique is hard to approximate within \(n^{1-\epsilon}\)
+Normal rank
@@ Property / cites work @@
+Linear-Time FPT Algorithms via Network Flow
@@ Property / cites work: Linear-Time FPT Algorithms via Network Flow / rank @@
+Normal rank
@@ Property / cites work @@
+The Linkage of a Graph
@@ Property / cites work: The Linkage of a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+The sandwich theorem
@@ Property / cites work: The sandwich theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Q2837833
@@ Property / cites work: Q2837833 / rank @@
+Normal rank
@@ Property / cites work @@
+A \(2k\)-kernelization algorithm for vertex cover based on crown decomposition
+Normal rank
@@ Property / cites work @@
+<i>k</i>-Degenerate Graphs
@@ Property / cites work: <i>k</i>-Degenerate Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques
+Normal rank
@@ Property / cites work @@
+On the Shannon capacity of a graph
@@ Property / cites work: On the Shannon capacity of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Smallest-last ordering and clustering and graph coloring algorithms
+Normal rank
@@ Property / cites work @@
+Minimum degree orderings
@@ Property / cites work: Minimum degree orderings / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex packings: Structural properties and algorithms
+Normal rank
@@ Property / cites work @@
+A general method to speed up fixed-parameter-tractable algorithms
+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 @@
+Fast Algorithms for the Maximum Clique Problem on Massive Sparse Graphs
+Normal rank
@@ Property / cites work @@
+Exact algorithms for maximum clique: a computational study
+Normal rank
@@ Property / cites work @@
+Minimum node covers and 2-bicritical graphs
@@ Property / cites work: Minimum node covers and 2-bicritical graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel Maximum Clique Algorithms with Applications to Network Analysis
+Normal rank
@@ Property / cites work @@
+A new exact maximum clique algorithm for large and massive sparse graphs
+Normal rank
@@ Property / cites work @@
+Infra-chromatic bound for exact maximum clique search
+Normal rank
@@ Property / cites work @@
+An enhanced bitstring encoding for exact maximum clique search in sparse graphs
+Normal rank
@@ Property / cites work @@
+A parallel maximum clique algorithm for large and massive sparse graphs
+Normal rank
@@ Property / cites work @@
+Preprocessing and Probing Techniques for Mixed Integer Programming Problems
+Normal rank
@@ Property / cites work @@
+An inequality for the chromatic number of a graph
@@ Property / cites work: An inequality for the chromatic number of a graph / 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 @@
+A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
+Normal rank
@@ Property / cites work @@
+Solving the Maximum Clique and Vertex Coloring Problems on Very Large Sparse Networks
+Normal rank
@@ Property / cites work @@
+Linear degree extractors and the inapproximability of max clique and chromatic number
+Normal rank