A 2k-vertex Kernel for Maximum Internal Spanning Tree (Q3449846): Difference between revisions

@@ Property / author @@
-Jian'er Chen
@@ Property / author: Jian'er Chen / rank @@
-Normal rank
@@ Property / author @@
+Jian'er Chen
@@ Property / author: Jian'er Chen / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1810979759
@@ Property / OpenAlex ID: W1810979759 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.8296
@@ Property / arXiv ID: 1412.8296 / rank @@
+Normal rank
@@ Property / cites work @@
+Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree}
+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 @@
+A linear vertex kernel for maximum internal spanning tree
+Normal rank
@@ Property / cites work @@
+Sharp separation and applications to exact and parameterized algorithms
+Normal rank
@@ Property / cites work @@
+Minimum leaf out-branching and related problems
@@ Property / cites work: Minimum leaf out-branching and related problems / rank @@
+Normal rank
@@ Property / cites work @@
+On the minimum diameter spanning tree problem
@@ Property / cites work: On the minimum diameter spanning tree problem / rank @@
+Normal rank
@@ Property / cites work @@
+A randomized linear-time algorithm to find minimum spanning trees
+Normal rank
@@ Property / cites work @@
+Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem
+Normal rank
@@ Property / cites work @@
+A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees
+Normal rank
@@ Property / cites work @@
+Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform Degree Bounds
+Normal rank
@@ Property / cites work @@
+Limits and Applications of Group Algebras for Parameterized Problems
+Normal rank
@@ Property / cites work @@
+Deeper Local Search for Better Approximation on Maximum Internal Spanning Trees
+Normal rank
@@ Property / cites work @@
+Approximating Maximum Leaf Spanning Trees in Almost Linear Time
+Normal rank
@@ Property / cites work @@
+Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems
+Normal rank
@@ Property / cites work @@
+Dynamic Scaling of Growing Interfaces
@@ Property / cites work: Dynamic Scaling of Growing Interfaces / 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 @@
+Approximating the maximum internal spanning tree problem
+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 @@
+Representative Families: A Unified Tradeoff-Based Approach
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3449846