Algorithms for \(k\)-internal out-branching and \(k\)-tree in bounded degree graphs
type: Item
instance of: scholarly article
title: Algorithms for \(k\)-internal out-branching and \(k\)-tree in bounded degree graphs
zbMATH Open document ID: 1361.05133
author: Meirav Zehavi
published in: Algorithmica
publication date: 2017-05-11T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W20
zbMATH DE Number: 6714294
zbMATH Keywords: parameterized algorithm
zbMATH Keywords: \(k\)-internal out-branching
zbMATH Keywords: \(k\)-tree
zbMATH Keywords: multilinear detection
zbMATH Keywords: proper coloring
MaRDI profile type: Publication
full work available at URL: s00453-016-0166-3
OpenAlex ID: W2406276733
cites work: Color-coding
cites work: Narrow sieves for parameterized paths and packings
cites work: Spotting Trees with Few Leaves
cites work: Algorithm for finding \(k\)-vertex out-trees and its application to \(k\)-internal out-branching problem
cites work: A linear vertex kernel for maximum internal spanning tree
cites work: Sharp separation and applications to exact and parameterized algorithms
cites work: Representative Sets of Product Families
cites work: Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms
cites work: Some simplified NP-complete graph problems
cites work: Minimum leaf out-branching and related problems
cites work: Faster Algebraic Algorithms for Path and Packing Problems
cites work: Limits and Applications of Group Algebras for Parameterized Problems
cites work: A 2k-vertex Kernel for Maximum Internal Spanning Tree
cites work: Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems
cites work: Q5710169
cites work: Spanning trees: A survey
cites work: Q3369936
cites work: Q4756732
cites work: Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree}
cites work: A survey on algorithms for the maximum internal spanning tree and related problems
cites work: Representative Families: A Unified Tradeoff-Based Approach
cites work: \(\Delta \)-list vertex coloring in linear time
cites work: Finding paths of length \(k\) in \(O^{*}(2^k)\) time
cites work: Algorithms for k-Internal Out-Branching
cites work: Mixing Color Coding-Related Techniques
DOI: 10.1007/S00453-016-0166-3
description: scientific article; zbMATH DE number 6714294