A generalization of Nemhauser and Trotter's local optimization theorem (Q657921): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jcss.2010.12.001
+Normal rank
@@ Property / OpenAlex ID @@
+W2125455032
@@ Property / OpenAlex ID: W2125455032 / 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 @@
+Clique Relaxations in Social Network Analysis: The Maximum <i>k</i>-Plex Problem
+Normal rank
@@ Property / cites work @@
+Q3221758
@@ Property / cites work: Q3221758 / rank @@
+Normal rank
@@ Property / cites work @@
+An Extension of the Nemhauser–Trotter Theorem to Generalized Vertex Cover with Applications
+Normal rank
@@ Property / cites work @@
+Kernelization: New Upper and Lower Bound Techniques
+Normal rank
@@ Property / cites work @@
+Reduction algorithms for graphs of small treewidth
+Normal rank
@@ Property / cites work @@
+Q5463498
@@ Property / cites work: Q5463498 / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex Cover: Further Observations and Further Improvements
+Normal rank
@@ Property / cites work @@
+A Linear Kernel for Co-Path/Cycle Packing
@@ Property / cites work: A Linear Kernel for Co-Path/Cycle Packing / rank @@
+Normal rank
@@ Property / cites work @@
+Crown reductions for the minimum weighted vertex cover problem
+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 @@
+Solving NP-hard semirandom graph problems in polynomial expected time
+Normal rank
@@ Property / cites work @@
+Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
+Normal rank
@@ Property / cites work @@
+Threshold dominating sets and an improved characterization of \(W[2]\)
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3570028
@@ Property / cites work: Q3570028 / rank @@
+Normal rank
@@ Property / cites work @@
+A Generalization of Nemhauser and Trotter's Local Optimization Theorem.
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+A More Relaxed Model for Graph-Based Data Clustering: <i>s</i>-Plex Cluster Editing
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for the Set Covering and Vertex Cover Problems
+Normal rank
@@ Property / cites work @@
+Q3002852
@@ Property / cites work: Q3002852 / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
+Normal rank
@@ Property / cites work @@
+Isolation concepts for efficiently enumerating dense subgraphs
+Normal rank
@@ Property / cites work @@
+Vertex packings: Structural properties and algorithms
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover
+Normal rank
@@ Property / cites work @@
+A new approach for approximating node deletion problems
+Normal rank
@@ Property / cites work @@
+Looking at the stars
@@ Property / cites work: Looking at the stars / rank @@
+Normal rank
@@ Property / cites work @@
+A graph‐theoretic generalization of the clique concept
+Normal rank
@@ Property / cites work @@
+An Improved Parameterized Algorithm for a Generalized Matching Problem
+Normal rank