On the Power of Simple Reductions for the Maximum Independent Set Problem (Q2817877): Difference between revisions

@@ Property / describes a project that uses @@
+WebGraph
@@ Property / describes a project that uses: WebGraph / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+SNAP
@@ Property / describes a project that uses: SNAP / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+BioGRID
@@ Property / describes a project that uses: BioGRID / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Pajek
@@ Property / describes a project that uses: Pajek / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2496359038
@@ Property / OpenAlex ID: W2496359038 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.00724
@@ Property / arXiv ID: 1608.00724 / rank @@
+Normal rank
@@ Property / cites work @@
+Crown structures for vertex cover kernelization
@@ Property / cites work: Crown structures for vertex cover kernelization / rank @@
+Normal rank
@@ Property / cites work @@
+On Finding Critical Independent and Vertex Sets
@@ Property / cites work: On Finding Critical Independent and Vertex Sets / 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 @@
+Fast local search for the maximum independent set problem
+Normal rank
@@ Property / cites work @@
+Q3043782
@@ Property / cites work: Q3043782 / rank @@
+Normal rank
@@ Property / cites work @@
+Improvements to MCS algorithm for the maximum clique problem
+Normal rank
@@ Property / cites work @@
+Fast algorithms for max independent set
@@ Property / cites work: Fast algorithms for max independent set / rank @@
+Normal rank
@@ Property / cites work @@
+Estimating the size of correcting codes using extremal graph problems
+Normal rank
@@ Property / cites work @@
+Using critical sets to solve the maximum independent set problem
+Normal rank
@@ Property / cites work @@
+Vertex Cover: Further Observations and Further Improvements
+Normal rank
@@ Property / cites work @@
+A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
+Normal rank
@@ Property / cites work @@
+Exact exponential algorithms.
@@ Property / cites work: Exact exponential algorithms. / rank @@
+Normal rank
@@ Property / cites work @@
+Kernelization Using Structural Parameters on Sparse Graph Classes
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+Q5441574
@@ Property / cites work: Q5441574 / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex packings: Structural properties and algorithms
+Normal rank
@@ Property / cites work @@
+An improved bit parallel exact maximum clique algorithm
+Normal rank
@@ Property / cites work @@
+An exact bit-parallel algorithm for the maximum clique problem
+Normal rank
@@ Property / cites work @@
+Some Experimental and Theoretical Results on Test Case Generators for the Maximum Clique Problem
+Normal rank
@@ Property / cites work @@
+A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
+Normal rank
@@ Property / cites work @@
+Confining sets and avoiding bottleneck cases: a simple maximum independent set algorithm in degree-3 graphs
+Normal rank
@@ Property / cites work @@
+Finding Critical Independent Sets and Critical Vertex Subsets are Polynomial Problems
+Normal rank