Publication:3369936
From MaRDI portal
zbMath1087.68075MaRDI QIDQ3369936
Christian Sloper, Elena Prieto
Publication date: 6 February 2006
Related Items
A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs, Unnamed Item, Spotting Trees with Few Leaves, Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem, Approximation algorithms for the maximum weight internal spanning tree problem, Beyond bidimensionality: parameterized subexponential algorithms on directed graphs, On the directed full degree spanning tree problem, Algorithms for \(k\)-internal out-branching and \(k\)-tree in bounded degree graphs, Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree, Looking at the stars, Representative families: a unified tradeoff-based approach, Algorithm for finding \(k\)-vertex out-trees and its application to \(k\)-internal out-branching problem, Minimum leaf out-branching and related problems, An approximation algorithm for maximum internal spanning tree, Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials, Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree}, A simple linear time algorithm to solve the MIST problem on interval graphs, Approximating spanning trees with few branches, Better approximation algorithms for the maximum internal spanning tree problem, A multivariate framework for weighted FPT algorithms, Sharp separation and applications to exact and parameterized algorithms, Solving the maximum internal spanning tree problem on interval graphs in polynomial time, A \(\frac{4}{3}\)-approximation algorithm for the maximum internal spanning tree problem, Out-branchings with Maximal Number of Leaves or Internal Vertices: Algorithmic Results and Open Problems, Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem, Spotting Trees with Few Leaves, A 2k-vertex Kernel for Maximum Internal Spanning Tree, Mixing Color Coding-Related Techniques
