Computing the differential of a graph: hardness, approximability and exact algorithms (Q2448922): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2012.11.013
+Normal rank
@@ Property / OpenAlex ID @@
+W2040446810
@@ Property / OpenAlex ID: W2040446810 / rank @@
+Normal rank
@@ Property / cites work @@
+Proof verification and the hardness of approximation problems
+Normal rank
@@ Property / cites work @@
+Q4258216
@@ Property / cites work: Q4258216 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds on the differential of a graph
@@ Property / cites work: Lower bounds on the differential of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack
+Normal rank
@@ Property / cites work @@
+An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set}
+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 @@
+SOFSEM 2006: Theory and Practice of Computer Science
+Normal rank
@@ Property / cites work @@
+An exact algorithm for the maximum leaf spanning tree problem
+Normal rank
@@ Property / cites work @@
+Searching Trees: An Essay
@@ Property / cites work: Searching Trees: An Essay / rank @@
+Normal rank
@@ Property / cites work @@
+Measure and conquer
@@ Property / cites work: Measure and conquer / rank @@
+Normal rank
@@ Property / cites work @@
+Solving connected dominating set faster than \(2^n\)
+Normal rank
@@ Property / cites work @@
+A measure &amp; conquer approach for the analysis of exact algorithms
+Normal rank
@@ Property / cites work @@
+Combinatorial bounds via measure and conquer
@@ Property / cites work: Combinatorial bounds via measure and conquer / rank @@
+Normal rank
@@ Property / cites work @@
+Exact exponential algorithms.
@@ Property / cites work: Exact exponential algorithms. / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for maximum triangle packing
+Normal rank
@@ Property / cites work @@
+Maximum bounded 3-dimensional matching is MAX SNP-complete
+Normal rank
@@ Property / cites work @@
+A Fine-grained Analysis of a Simple Independent Set Algorithm
+Normal rank
@@ Property / cites work @@
+Matching theory
@@ Property / cites work: Matching theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q5488331
@@ Property / cites work: Q5488331 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization, approximation, and complexity classes
+Normal rank
@@ Property / cites work @@
+Efficiency in exponential time for domination-type problems
+Normal rank
@@ Property / cites work @@
+Enclaveless sets and MK-Systems
@@ Property / cites work: Enclaveless sets and MK-Systems / rank @@
+Normal rank
@@ Property / cites work @@
+On feedback vertex sets and nonseparating independent sets in cubic graphs
+Normal rank
@@ Property / cites work @@
+Exact algorithms for dominating set
@@ Property / cites work: Exact algorithms for dominating set / rank @@
+Normal rank
@@ Property / cites work @@
+Inclusion/Exclusion Meets Measure and Conquer
@@ Property / cites work: Inclusion/Exclusion Meets Measure and Conquer / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for metric facility location and             <i>k</i>             -Median problems using the primal-dual schema and Lagrangian relaxation
+Normal rank
@@ Property / cites work @@
+A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances
+Normal rank
@@ Property / cites work @@
+The toughness of split graphs
@@ Property / cites work: The toughness of split graphs / rank @@
+Normal rank