Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree} (Q1939668): Difference between revisions

@@ Property / DOI @@
-.1007/s00453-011-9575-5
@@ Property / DOI: 10.1007/s00453-011-9575-5 / rank @@
-Normal rank
@@ Property / cites work @@
+Reverse search for enumeration
@@ Property / cites work: Reverse search for enumeration / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic Programming Treatment of the Travelling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Enumerate and Measure: Improving Parameter Budget Management
+Normal rank
@@ Property / cites work @@
+Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack
+Normal rank
@@ Property / cites work @@
+Fourier meets M\"{o}bius: fast subset convolution
@@ Property / cites work: Fourier meets M\"{o}bius: fast subset convolution / 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 @@
+Algorithm for finding \(k\)-vertex out-trees and its application to \(k\)-internal out-branching problem
+Normal rank
@@ Property / cites work @@
+The Traveling Salesman Problem for Cubic Graphs
@@ Property / cites work: The Traveling Salesman Problem for Cubic Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology
+Normal rank
@@ Property / cites work @@
+Exact and Parameterized Algorithms for Max Internal Spanning Tree
+Normal rank
@@ Property / cites work @@
+An Exact Algorithm for the Maximum Leaf Spanning Tree Problem
+Normal rank
@@ Property / cites work @@
+On the minimum feedback vertex set problem: Exact and enumeration algorithms
+Normal rank
@@ Property / cites work @@
+A Linear Vertex Kernel for Maximum Internal Spanning Tree
+Normal rank
@@ Property / cites work @@
+A measure &amp; conquer approach for the analysis of exact algorithms
+Normal rank
@@ Property / cites work @@
+Solving connected dominating set faster than \(2^n\)
+Normal rank
@@ Property / cites work @@
+Exact exponential algorithms.
@@ Property / cites work: Exact exponential algorithms. / rank @@
+Normal rank
@@ Property / cites work @@
+Sharp Separation and Applications to Exact and Parameterized Algorithms
+Normal rank
@@ Property / cites work @@
+A Moderately Exponential Time Algorithm for Full Degree Spanning Tree
+Normal rank
@@ Property / cites work @@
+A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between
+Normal rank
@@ Property / cites work @@
+A Dynamic Programming Approach to Sequencing Problems
+Normal rank
@@ Property / cites work @@
+An Improved Exact Algorithm for Cubic Graph TSP
@@ Property / cites work: An Improved Exact Algorithm for Cubic Graph TSP / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic programming meets the principle of inclusion and exclusion
+Normal rank
@@ Property / cites work @@
+Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem
+Normal rank
@@ Property / cites work @@
+Saving space by algebraization
@@ Property / cites work: Saving space by algebraization / rank @@
+Normal rank
@@ Property / cites work @@
+Even Faster Algorithm for Set Splitting!
@@ Property / cites work: Even Faster Algorithm for Set Splitting! / rank @@
+Normal rank
@@ Property / cites work @@
+On cliques in graphs
@@ Property / cites work: On cliques in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting
+Normal rank
@@ Property / cites work @@
+Spanning trees: A survey
@@ Property / cites work: Spanning trees: A survey / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and Data Structures
@@ Property / cites work: Algorithms and Data Structures / rank @@
+Normal rank
@@ Property / cites work @@
+Q3369936
@@ Property / cites work: Q3369936 / rank @@
+Normal rank
@@ Property / cites work @@
+An Amortized Search Tree Analysis for k-Leaf Spanning Tree
+Normal rank
@@ Property / cites work @@
+Algorithms for maximum independent sets
@@ Property / cites work: Algorithms for maximum independent sets / rank @@
+Normal rank
@@ Property / cites work @@
+On finding spanning trees with few leaves
@@ Property / cites work: On finding spanning trees with few leaves / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the maximum internal spanning tree problem
+Normal rank
@@ Property / cites work @@
+Q2861557
@@ Property / cites work: Q2861557 / rank @@
+Normal rank
@@ Property / cites work @@
+Refined memorization for vertex cover
@@ Property / cites work: Refined memorization for vertex cover / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S00453-011-9575-5
@@ Property / DOI: 10.1007/S00453-011-9575-5 / rank @@
+Normal rank