Publication:4252040
From MaRDI portal
zbMath0932.68069MaRDI QIDQ4252040
Publication date: 13 March 2000
05C05: Trees
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs, Spanning Trees with Many Leaves in Regular Bipartite Graphs, A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs, Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms, Better Algorithms and Bounds for Directed Maximum Leaf Problems, Leafy spanning trees in hypercubes, Improved bounds for spanning trees with many leaves, Max-leaves spanning tree is APX-hard for cubic graphs, Optimal wake-up scheduling of data gathering trees for wireless sensor networks, An exact exponential-time algorithm for the directed maximum leaf spanning tree problem, A new algorithm for finding trees with many leaves, Spanning trees: A survey, FPT algorithms and kernels for the directed \(k\)-leaf problem, Reformulations and solution algorithms for the maximum leaf spanning tree problem, Connected domination of regular graphs, Approximating the maximum internal spanning tree problem, An exact algorithm for the maximum leaf spanning tree problem., A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks, On finding spanning trees with few leaves, Out-branchings with Maximal Number of Leaves or Internal Vertices: Algorithmic Results and Open Problems, Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree, On Finding Directed Trees with Many Leaves
