scientific article

zbMath1087.68075MaRDI QIDQ3369936

Christian Sloper, Elena Prieto

Publication date: 6 February 2006

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10)

Related Items (28)

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

This page was built for publication: