Reducing to independent set structure -- the case of k-internal spanning tree
From MaRDI portal
Publication:3369936
zbMATH Open1087.68075MaRDI QIDQ3369936FDOQ3369936
Authors: Elena Prieto, Christian Sloper 
Publication date: 6 February 2006
Recommendations
- A \(2k\)-vertex kernel for maximum internal spanning tree
- A linear vertex kernel for maximum internal spanning tree
- A linear vertex kernel for Maximum Internal Spanning Tree
- Algorithms and Data Structures
- Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree
Cited In (28)
- Beyond bidimensionality: parameterized subexponential algorithms on directed graphs
- 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
- Minimum leaf out-branching and related problems
- Patching colors with tensors
- Looking at the stars
- Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials
- Spotting trees with few leaves
- A \(2k\)-vertex kernel for maximum internal spanning tree
- Spotting trees with few leaves
- A linear vertex kernel for Maximum Internal Spanning Tree
- Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree
- Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem
- On the directed full degree spanning tree problem
- Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem
- A simple linear time algorithm to solve the MIST problem on interval graphs
- Out-branchings with maximal number of leaves or internal vertices: algorithmic results and open problems
- Algorithm for finding \(k\)-vertex out-trees and its application to \(k\)-internal out-branching problem
- Better approximation algorithms for the maximum internal spanning tree problem
- Mixing Color Coding-Related Techniques
- A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs
- A linear vertex kernel for maximum internal spanning tree
- Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree}
- A multivariate framework for weighted FPT algorithms
- Representative families: a unified tradeoff-based approach
- Approximating spanning trees with few branches
- Algorithms for \(k\)-internal out-branching and \(k\)-tree in bounded degree graphs
This page was built for publication: Reducing to independent set structure -- the case of \(k\)-internal spanning tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3369936)
