Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree}
From MaRDI portal
Publication:1939668
Recommendations
- Exact and parameterized algorithms for Max Internal Spanning Tree
- A survey on algorithms for the maximum internal spanning tree and related problems
- A \(\frac{4}{3}\)-approximation algorithm for the maximum internal spanning tree problem
- Approximation Algorithms for the Maximum Internal Spanning Tree Problem
- Approximating the maximum internal spanning tree problem
Cites work
- A Dynamic Programming Approach to Sequencing Problems
- A Moderately Exponential Time Algorithm for Full Degree Spanning Tree
- A linear vertex kernel for Maximum Internal Spanning Tree
- A measure \& conquer approach for the analysis of exact algorithms
- A survey on algorithms for the maximum internal spanning tree and related problems
- A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between
- Algorithm for finding \(k\)-vertex out-trees and its application to \(k\)-internal out-branching problem
- Algorithms and Data Structures
- Algorithms for maximum independent sets
- An Improved Exact Algorithm for Cubic Graph TSP
- An amortized search tree analysis for k-leaf spanning tree
- An exact algorithm for the maximum leaf spanning tree problem
- Approximating the maximum internal spanning tree problem
- Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem
- Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack
- Dynamic Programming Treatment of the Travelling Salesman Problem
- Dynamic programming meets the principle of inclusion and exclusion
- Enumerate and measure: improving parameter budget management
- Even faster algorithm for set splitting!
- Exact and parameterized algorithms for Max Internal Spanning Tree
- Exact exponential algorithms.
- Fourier meets M\"{o}bius: fast subset convolution
- Improved upper bounds for vertex cover
- Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting
- On cliques in graphs
- On finding spanning trees with few leaves
- On the minimum feedback vertex set problem: Exact and enumeration algorithms
- Reducing to independent set structure -- the case of k-internal spanning tree
- Refined memorization for vertex cover
- Reverse search for enumeration
- Saving space by algebraization
- Sharp separation and applications to exact and parameterized algorithms
- Solving connected dominating set faster than \(2^n\)
- Spanning trees: A survey
- The Traveling Salesman Problem for Cubic Graphs
- Towards fully multivariate algorithmics: some new results and directions in parameter ecology
- Vertex cover: Further observations and further improvements
Cited in
(33)- Algorithms and Data Structures
- 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
- Depth first search in claw-free graphs
- Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs
- Algorithms for k-internal out-branching
- Spotting trees with few leaves
- A 2k-vertex kernel for maximum internal spanning tree
- Spotting trees with few leaves
- Exact Algorithms for the Minimum Load Spanning Tree Problem
- Exact and parameterized algorithms for Max Internal Spanning Tree
- Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree
- Finding a minimum spanning tree with a small non-terminal set
- Scatter search for the minimum leaf spanning tree problem
- Parameterized complexity of modular dominating structures in bounded-treewidth graphs
- Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs
- A survey on algorithms for the maximum internal spanning tree and related problems
- Parameterized algorithms for non-separating trees and branchings in digraphs
- On the Number of Connected Sets in Bounded Degree Graphs
- A simple linear time algorithm to solve the MIST problem on interval graphs
- The \(k\)-leaf spanning tree problem admits a klam value of 39
- Leaf-critical and leaf-stable graphs
- On the number of connected sets in bounded degree graphs
- Exact algorithms for counting 3-colorings of graphs
- 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
- Sharp separation and applications to exact and parameterized algorithms
- Complexity of independency and cliquy trees
- A multivariate framework for weighted FPT algorithms
- Representative families: a unified tradeoff-based approach
- Algorithms for maximum internal spanning tree problem for some graph classes
- Algorithms for \(k\)-internal out-branching and \(k\)-tree in bounded degree graphs
This page was built for publication: Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree}
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1939668)
