We describe a new, fast, and fairly simple FPT algorithm for the problem of deciding whether a given input graph G has a spanning tree with at least k leaves. The time complexity of our algorithm is polynomially bounded in the size of G, and its dependence on k is roughly O(9.49 k ). This is the fastest currently known algorithm for this problem
Discrete AlgorithmsThe problem of finding a spanning tree in an undirected graph with a maximum numb...
The preoblem of finding a spanning tree with maximum number of leaves is studied. A simple 2-approxi...
AbstractGiven a directed graph G=(V,A), the Directed Maximum Leaf Spanning Tree problem asks to comp...
We describe a new, fast, and fairly simple FPT algorithm for the problem of deciding whether a given...
We present two lower bounds for the maximum number of leaves in a spanning tree of a graph. For conn...
The problem of finding a spanning tree in an undirected graph with a maximum number of leaves is kno...
International audienceGiven an undirected graph G with n nodes, the Maximum Leaf Spanning Tree probl...
AbstractGiven an undirected graph with n vertices, the Maximum Leaf Spanning Tree problem is to find...
Abstract. Given an undirected graph with n nodes, the Maximum Leaf Spanning Tree problem is to find ...
We prove that the NP-hard problem of finding in an undirected graph G a spanning tree with a maximum...
Given an undirected graph, nding a spanning tree of the graph with maximum number of leaves is MAX ...
Abstract. To determine if a graph has a spanning tree with few leaves is NP-hard. In this paper we s...
Abstract. We describe some new, simple and apparently general meth-ods for designing FPT algorithms,...
A connected graph having large minimum vertex degree must have a spanning tree with many leaves. In ...
Given a graph G = (V, E), the maximum leaf spanning tree problem (MLSTP) is to find a spanning tree ...
Discrete AlgorithmsThe problem of finding a spanning tree in an undirected graph with a maximum numb...
The preoblem of finding a spanning tree with maximum number of leaves is studied. A simple 2-approxi...
AbstractGiven a directed graph G=(V,A), the Directed Maximum Leaf Spanning Tree problem asks to comp...
We describe a new, fast, and fairly simple FPT algorithm for the problem of deciding whether a given...
We present two lower bounds for the maximum number of leaves in a spanning tree of a graph. For conn...
The problem of finding a spanning tree in an undirected graph with a maximum number of leaves is kno...
International audienceGiven an undirected graph G with n nodes, the Maximum Leaf Spanning Tree probl...
AbstractGiven an undirected graph with n vertices, the Maximum Leaf Spanning Tree problem is to find...
Abstract. Given an undirected graph with n nodes, the Maximum Leaf Spanning Tree problem is to find ...
We prove that the NP-hard problem of finding in an undirected graph G a spanning tree with a maximum...
Given an undirected graph, nding a spanning tree of the graph with maximum number of leaves is MAX ...
Abstract. To determine if a graph has a spanning tree with few leaves is NP-hard. In this paper we s...
Abstract. We describe some new, simple and apparently general meth-ods for designing FPT algorithms,...
A connected graph having large minimum vertex degree must have a spanning tree with many leaves. In ...
Given a graph G = (V, E), the maximum leaf spanning tree problem (MLSTP) is to find a spanning tree ...
Discrete AlgorithmsThe problem of finding a spanning tree in an undirected graph with a maximum numb...
The preoblem of finding a spanning tree with maximum number of leaves is studied. A simple 2-approxi...
AbstractGiven a directed graph G=(V,A), the Directed Maximum Leaf Spanning Tree problem asks to comp...
DOI
Add to ORKG