Algorithms for \(k\)-internal out-branching and \(k\)-tree in bounded degree graphs
From MaRDI portal
Publication:527430
DOI10.1007/s00453-016-0166-3zbMath1361.05133OpenAlexW2406276733MaRDI QIDQ527430
Publication date: 11 May 2017
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-016-0166-3
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spanning trees: A survey
- \(\Delta \)-list vertex coloring in linear time
- Finding paths of length \(k\) in \(O^{*}(2^k)\) time
- Algorithm for finding \(k\)-vertex out-trees and its application to \(k\)-internal out-branching problem
- Minimum leaf out-branching and related problems
- Some simplified NP-complete graph problems
- A linear vertex kernel for maximum internal spanning tree
- Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree}
- Narrow sieves for parameterized paths and packings
- Sharp separation and applications to exact and parameterized algorithms
- Algorithms for k-Internal Out-Branching
- Representative Sets of Product Families
- Representative Families: A Unified Tradeoff-Based Approach
- Spotting Trees with Few Leaves
- A 2k-vertex Kernel for Maximum Internal Spanning Tree
- Mixing Color Coding-Related Techniques
- Faster Algebraic Algorithms for Path and Packing Problems
- Limits and Applications of Group Algebras for Parameterized Problems
- Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems
- Color-coding
- Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms
This page was built for publication: Algorithms for \(k\)-internal out-branching and \(k\)-tree in bounded degree graphs
