On finding spanning trees with few leaves
From MaRDI portal
Publication:2380066
Recommendations
- A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs
- A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs
- A 3/2-approximation algorithm for finding spanning trees with many leaves in cubic graphs
- scientific article; zbMATH DE number 1305098
- Spanning Trees with Many Leaves
Cites work
- Approximating Maximum Leaf Spanning Trees in Almost Linear Time
- Approximation Algorithms for the Maximum Internal Spanning Tree Problem
- scientific article; zbMATH DE number 47903 (Why is no real title available?)
- scientific article; zbMATH DE number 1305098 (Why is no real title available?)
- On approximating the longest path in a graph
- Spanning spiders and light-splitting switches
Cited in
(35)- Approximating the maximum internal spanning tree problem
- On finding most uniform spanning trees
- Decomposition methods based on articulation vertices for degree-dependent spanning tree problems
- Depth first search in claw-free graphs
- Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree}
- Algorithms for maximum internal spanning tree problem for some graph classes
- Scatter search for the minimum leaf spanning tree problem
- A simple linear time algorithm to solve the MIST problem on interval graphs
- On minimum leaf spanning trees and a criticality notion
- Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs
- Relations, models and a memetic approach for three degree-dependent spanning tree problems
- On the minimum leaf number of cubic graphs
- Approximating spanning trees with few branches
- Better approximation algorithms for the maximum internal spanning tree problem
- Cutting-plane-based algorithms for two branch vertices related spanning tree problems
- On spanning cycles, paths and trees
- 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
- Unrooted non-binary tree-based phylogenetic networks
- Conditions for spanning trees whose internal subtrees have few branch vertices and leaves
- A survey on algorithms for the maximum internal spanning tree and related problems
- Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem
- Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem
- A 2k-vertex kernel for maximum internal spanning tree
- On the number of leaves of a euclidean minimal spanning tree
- A polynomial time algorithm for finding a spanning tree with maximum number of internal vertices on interval graphs
- Spanning k-ended trees of 3-regular connected graphs
- Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs
- scientific article; zbMATH DE number 7132826 (Why is no real title available?)
- How far is my network from being edge-based? Proximity measures for edge-basedness of unrooted phylogenetic networks
- An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth
- Spanning trees: A survey
- Spanning trees for many different numbers of leaves
- Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree
- Network fault costs based on minimum leaf spanning trees
This page was built for publication: On finding spanning trees with few leaves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2380066)
