An exact algorithm for the maximum leaf spanning tree problem
From MaRDI portal
(Redirected from Publication:653320)
Recommendations
- An exact algorithm for the maximum leaf spanning tree problem
- An exact exponential-time algorithm for the directed maximum leaf spanning tree problem
- A faster exact algorithm for the directed maximum leaf spanning tree problem
- An exact algorithm for the maximum leaf spanning tree problem.
- An amortized search tree analysis for \(k\)-leaf spanning tree
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2080206 (Why is no real title available?)
- scientific article; zbMATH DE number 806748 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- A New Algorithm for Finding Trees with Many Leaves
- A measure \& conquer approach for the analysis of exact algorithms
- An exact algorithm for the maximum leaf spanning tree problem
- Exact exponential algorithms.
- FPT algorithms and kernels for the directed \(k\)-leaf problem
- Mathematical Foundations of Computer Science 2003
- On Linear Time Minor Tests with Depth-First Search
- Primal-dual algorithms for connected facility location problems
- Simpler and better approximation algorithms for network design
- Solving connected dominating set faster than \(2^n\)
- Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms
Cited in
(24)- Kernelization for maximum leaf spanning tree with positive vertex weights
- scientific article; zbMATH DE number 6611438 (Why is no real title available?)
- Regenerator location problem: polyhedral study and effective branch-and-cut algorithms
- Inclusion/exclusion meets measure and conquer
- An exact algorithm for the maximum leaf spanning tree problem.
- On connected dominating sets of restricted diameter
- An amortized search tree analysis for \(k\)-leaf spanning tree
- scientific article; zbMATH DE number 5777935 (Why is no real title available?)
- Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights
- Below all subsets for minimal connected dominating set
- A faster exact algorithm for the directed maximum leaf spanning tree problem
- scientific article; zbMATH DE number 2080206 (Why is no real title available?)
- Reformulations and solution algorithms for the maximum leaf spanning tree problem
- An exact algorithm for the maximum leaf spanning tree problem
- Computing the differential of a graph: hardness, approximability and exact algorithms
- The \(k\)-leaf spanning tree problem admits a klam value of 39
- The \(k\)-leaf spanning tree problem admits a klam value of 39
- Benders decomposition, branch-and-cut, and hybrid algorithms for the minimum connected dominating set problem
- Efficient local search based on dynamic connectivity maintenance for minimum connected dominating set
- An amortized search tree analysis for finding a \(k\)-leaf spanning tree in an undirected graph
- An exact exponential-time algorithm for the directed maximum leaf spanning tree problem
- Complexity of the maximum leaf spanning tree problem on planar and regular graphs
- A 2-approximation algorithm for finding a spanning tree with maximum number of leaves
- Robust connectivity of graphs on surfaces
This page was built for publication: An exact algorithm for the maximum leaf spanning tree problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q653320)
