Algorithms for k-Internal Out-Branching

DOI10.1007/978-3-319-03898-8_30zbMath1359.05130OpenAlexW269904427MaRDI QIDQ2867096

Meirav Zehavi

Publication date: 10 December 2013

Published in: Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-03898-8_30

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20)

Related Items (13)

Spotting Trees with Few Leaves ⋮ Spotting Trees with Few Leaves ⋮ A Multivariate Approach for Weighted FPT Algorithms ⋮ Mixing Color Coding-Related Techniques ⋮ Solving the maximum internal spanning tree problem on interval graphs in polynomial time ⋮ 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 ⋮ A multivariate framework for weighted FPT algorithms ⋮ Exact Algorithms for the Minimum Load Spanning Tree Problem ⋮ Discriminantal subset convolution: refining exterior-algebraic methods for parameterized algorithms ⋮ Representative families: a unified tradeoff-based approach ⋮ A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs ⋮ Algorithms for \(k\)-internal out-branching and \(k\)-tree in bounded degree graphs

This page was built for publication: Algorithms for k-Internal Out-Branching