Enumerate and expand: Improved algorithms for connected vertex cover and tree cover (Q929296): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00224-007-9089-3
+Normal rank
@@ Property / OpenAlex ID @@
+W2076461672
@@ Property / OpenAlex ID: W2076461672 / rank @@
+Normal rank
@@ Property / cites work @@
+An improved fixed-parameter algorithm for vertex cover
+Normal rank
@@ Property / cites work @@
+Refined memorization for vertex cover
@@ Property / cites work: Refined memorization for vertex cover / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex Cover: Further Observations and Further Improvements
+Normal rank
@@ Property / cites work @@
+The steiner problem in graphs
@@ Property / cites work: The steiner problem in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4808679
@@ Property / cites work: Q4808679 / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex and edge covers with clustering properties: Complexity and algorithms
+Normal rank
@@ Property / cites work @@
+Algorithms and Data Structures
@@ Property / cites work: Algorithms and Data Structures / rank @@
+Normal rank
@@ Property / cites work @@
+Enumerate and Expand: New Runtime Bounds for Vertex Cover Variants
+Normal rank
@@ Property / cites work @@
+A Faster Algorithm for the Steiner Tree Problem
@@ Property / cites work: A Faster Algorithm for the Steiner Tree Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4251072
@@ Property / cites work: Q4251072 / rank @@
+Normal rank
@@ Property / cites work @@
+On efficient fixed-parameter algorithms for weighted vertex cover
+Normal rank