Solving the maximum internal spanning tree problem on interval graphs in polynomial time (Q2636496): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2017.09.017
@@ Property / DOI: 10.1016/j.tcs.2017.09.017 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2017.09.017
+Normal rank
@@ Property / OpenAlex ID @@
+W2757350721
@@ Property / OpenAlex ID: W2757350721 / 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 @@
+Neighborhood unions and extremal spanning trees
@@ Property / cites work: Neighborhood unions and extremal spanning trees / rank @@
+Normal rank
@@ Property / cites work @@
+Sharp separation and applications to exact and parameterized algorithms
+Normal rank
@@ Property / cites work @@
+A linear vertex kernel for maximum internal spanning tree
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic graph theory and perfect graphs
@@ Property / cites work: Algorithmic graph theory and perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem
+Normal rank
@@ Property / cites work @@
+Spanning trees with at most 3 leaves in \(K_{1,4}\)-free graphs
+Normal rank
@@ Property / cites work @@
+Approximating the Maximum Internal Spanning Tree Problem via a Maximum Path-Cycle Cover
+Normal rank
@@ Property / cites work @@
+Deeper Local Search for Better Approximation on Maximum Internal Spanning Trees
+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 @@
+A unified approach to domination problems on interval graphs
+Normal rank
@@ Property / cites work @@
+Linear algorithm for optimal path cover problem on interval graphs
+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 @@
+Algorithms for k-Internal Out-Branching
@@ Property / cites work: Algorithms for k-Internal Out-Branching / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2017.09.017
@@ Property / DOI: 10.1016/J.TCS.2017.09.017 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2636496